Source authenticated

A directed Erdős-Sós theorem for Eulerian digraphs

Registry resolution: resolved. Reported result type: proved. The registry record and named primary source provide the statement and scope.

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Sep 10, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: A directed Erdős-Sós theorem for Eulerian digraphs · Erdős-Sós for digraphs

Confidence: Not scored

Registry verification: unreviewed · preprint · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

GPT-6 Astra
model · ai model contributor · OpenAI

Dhruv Mubayi
human · human collaborator

Jacques Verstraëte
human · human collaborator

Evidence vector

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Named evidence

VibeMathed record: A directed Erdős-Sós theorem for Eulerian digraphs

specialist registry · passed

Checked here on 22 September 2026 against arXiv:2609.10987: the abstract states that every Eulerian digraph on $n$ vertices with more than $(t-1)n$ arcs contains every oriented tree with $t$ edges, that the bound is sharp for each fixed oriented tree by disjoint unions of complete bidirected graphs, and that tight bounds were not previously known even for directed paths. It is described there as a directed analogue of the recently proved Erdős-Sós conjecture, which this catalog records as erdos-problem-548. The mathematics was not checked here; twelve days old, no referee.

Source ↗

The Erdős-Sós conjecture this generalises, also proved by GPT-6 Astra

witness · pending

other link supplied by the VibeMathed registry.

Source ↗

A directed Erdős-Sós theorem for Eulerian digraphs

preprint · pending

Primary source named by the VibeMathed record. Presence in this import is not an independent mathematical verification.

Source ↗

Lineage and corrections

VibeMathed record: A directed Erdős-Sós theorem for Eulerian digraphs evidence for this event

A directed Erdős-Sós theorem for Eulerian digraphs evidence for this event

Registry resolution: resolved. Reported result type: proved. The registry record and named primary source provide the statement and scope. parent of this event

This event attributed to Dhruv Mubayi

This event attributed to Jacques Verstraëte

The Erdős-Sós conjecture this generalises, also proved by GPT-6 Astra evidence for this event

A directed Erdős-Sós theorem for Eulerian digraphs parent of this event

This event attributed to GPT-6 Astra

Act on this frontier

Verify, challenge, or extend the result.

Help verify Open canonical problem Explore evidence graph