Hamilton cycles in graphs and hypergraphs: an extremal perspective
From MaRDI portal
Publication:4589011
zbMath1373.05100arXiv1402.4268MaRDI QIDQ4589011
Publication date: 6 November 2017
Full work available at URL: https://arxiv.org/abs/1402.4268
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (33)
Spanning surfaces in \(3\)-graphs ⋮ Hamiltonicity in cherry-quasirandom 3-graphs ⋮ Counting Hamilton cycles in Dirac hypergraphs ⋮ Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ Spanning trees of dense directed graphs ⋮ Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs ⋮ Matching number, Hamiltonian graphs and magnetic Laplacian matrices ⋮ The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph ⋮ Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ Oriented discrepancy of Hamilton cycles ⋮ Cycle lengths in randomly perturbed graphs ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Proof of Komlós's conjecture on Hamiltonian subsets ⋮ A Dirac-type theorem for Berge cycles in random hypergraphs ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Completion and deficiency problems ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs ⋮ Longest Paths in Random Hypergraphs ⋮ Forbidding Hamilton cycles in uniform hypergraphs ⋮ Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs ⋮ Hamilton cycles in hypergraphs below the Dirac threshold ⋮ Rainbow factors in hypergraphs ⋮ Embedding spanning subgraphs in uniformly dense and inseparable graphs ⋮ Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs ⋮ Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs ⋮ Hamiltonian Berge cycles in random hypergraphs ⋮ A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs ⋮ Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
This page was built for publication: Hamilton cycles in graphs and hypergraphs: an extremal perspective
