Pages that link to "Item:Q3169283"

The following pages link to A proof of Sumner's universal tournament conjecture for large tournaments (Q3169283):

Displaying 25 items.

• A Ramsey type result for oriented trees (Q338566) (← links)
• A survey on Hamilton cycles in directed graphs (Q412269) (← links)
• An approximate version of Sumner's universal tournament conjecture (Q651033) (← links)
• Hoàng-Reed conjecture holds for tournaments (Q932618) (← links)
• Trees with few leaves in tournaments (Q2131862) (← links)
• Spanning trees of dense directed graphs (Q2132400) (← links)
• A proof of Sumner's universal tournament conjecture for large tournaments (Q2857428) (← links)
• The robust component structure of dense regular graphs and applications (Q2940076) (← links)
• Tournaments and Semicomplete Digraphs (Q3120434) (← links)
• Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture (Q4521493) (← links)
• Squaring a tournament: A proof of Dean's conjecture (Q4892341) (← links)
• Acyclic subgraphs of tournaments with high chromatic number (Q4999677) (← links)
• Orientation Ramsey Thresholds for Cycles and Cliques (Q5013576) (← links)
• A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs (Q5084096) (← links)
• The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)
• An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs (Q5364255) (← links)
• Cycle partitions of regular graphs (Q5886097) (← links)
• Directed Ramsey number for trees (Q5915808) (← links)
• Trees in tournaments (Q5917541) (← links)
• On the unavoidability of oriented trees (Q5918100) (← links)
• On the unavoidability of oriented trees (Q5918670) (← links)
• Unavoidable structures in infinite tournaments (Q6602152) (← links)
• Ramsey numbers of sparse digraphs (Q6635126) (← links)
• Trees with many leaves in tournaments (Q6652097) (← links)
• Directed graphs with lower orientation Ramsey thresholds (Q6658478) (← links)