Hamilton cycles in dense vertex-transitive graphs
From MaRDI portal
Publication:462925
DOI10.1016/j.jctb.2014.05.001zbMath1301.05204arXiv1008.2193OpenAlexW3102222413MaRDI QIDQ462925
András Máthé, Demetres Christofides, Jan Hladký
Publication date: 22 October 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.2193
Related Items (5)
The robust component structure of dense regular graphs and applications ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Tight cycles and regular slices in dense hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
- Hamilton cycles and paths in vertex-transitive graphs-current directions
- Hamiltonian paths in Cayley graphs
- A method in graph theory
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- Blow-up lemma
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- The square of every two-connected graph is Hamiltonian
- A Semiexact Degree Condition for Hamilton Cycles in Digraphs
- Long cycles in vertex-transitive graphs
- Finding Hamilton cycles in robustly expanding digraphs
- Quasirandom Groups
- Embedding large subgraphs into dense graphs
- An algorithmic version of the blow-up lemma
- The Algorithmic Aspects of the Regularity Lemma
- Packings in Dense Regular Graphs
- Digraphs
- Quasi-random graphs
- A survey: Hamiltonian cycles in Cayley graphs
This page was built for publication: Hamilton cycles in dense vertex-transitive graphs
