Tight bounds for powers of Hamilton cycles in tournaments
From MaRDI portal
Publication:2101176
DOI10.1016/j.jctb.2022.10.002zbMath1502.05118arXiv2103.10414OpenAlexW4308528785MaRDI QIDQ2101176
Nemanja Draganić, David Munhá Correia, Benjamin Sudakov
Publication date: 28 November 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.10414
Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey on Hamilton cycles in directed graphs
- Powers of Hamilton cycles in tournaments
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Proof of the Seymour conjecture for large graphs
- Norm-graphs: Variations and applications
- An extension of the Erdős-Stone theorem
- Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
- Perfect matchings in \(r\)-partite \(r\)-graphs
- Norm-graphs and bipartite Turán numbers
- A note on some embedding problems for oriented graphs
- Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
- Dependent random choice
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- Notes on the Erdös-Stone Theorem
- On the Structure of Edge Graphs II
- Hamilton Cycles in Oriented Graphs
- Edge Disjoint Hamiltonian Cycles in Highly Connected Tournaments
- Sparse Spanning $k$-Connected Subgraphs in Tournaments
- Matchings in hypergraphs of large minimum degree
- Minimal Regular Graphs of Girths Eight and Twelve
- On Graphs that do not Contain a Thomsen Graph
- Some Theorems on Abstract Graphs
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
- Powers of paths in tournaments
