Hamilton cycles in pseudorandom graphs
From MaRDI portal
Publication:6639724
DOI10.1016/j.aim.2024.109984MaRDI QIDQ6639724
David Munhá Correia, Stefan Glock, Benjamin Sudakov
Publication date: 18 November 2024
Published in: Advances in Mathematics (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Eulerian and Hamiltonian graphs (05C45) Expander graphs (05C48)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The size Ramsey number of a directed path
- Hamilton cycles in dense vertex-transitive graphs
- Hamilton cycles in highly connected and expanding graphs
- Hamiltonian cycles in Dirac graphs
- Hamiltonian paths in Cayley graphs
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Expanding graphs contain all small trees
- An algorithm for finding Hamilton paths and cycles in random graphs
- Explicit construction of linear sized tolerant networks
- The linear arboricity of graphs
- Hamiltonian circuits in random graphs
- Hamilton cycles in random subgraphs of pseudo-random graphs
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Recent advances on the Hamiltonian problem: survey III
- Additive patterns in multiplicative subgroups
- A note on Hamiltonian circuits
- On representatives of subsets.
- A remark on Hamilton cycles with few colors
- Random regular graphs of high degree
- Random Latin square graphs
- Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
- Long cycles in vertex-transitive graphs
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- Approximate Hamilton decompositions of random graphs
- Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
- Random Cayley graphs and expanders
- Almost all regular graphs are hamiltonian
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- Sparse pseudo‐random graphs are Hamiltonian
- Almost all Cayley graphs are hamiltonian
- Rolling backwards can move you forward: On embedding problems in sparse expanders
- Counting Hamilton Decompositions of Oriented Graphs
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- Robust Hamiltonicity of Dirac graphs
- Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
- Some Theorems on Abstract Graphs
This page was built for publication: Hamilton cycles in pseudorandom graphs
