Recent advances on Dirac-type problems for hypergraphs
From MaRDI portal
Publication:2957178
DOI10.1007/978-3-319-24298-9_6zbMath1354.05100arXiv1508.06170OpenAlexW1923478559MaRDI QIDQ2957178
Publication date: 25 January 2017
Published in: Recent Trends in Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.06170
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (47)
Hamiltonicity in cherry-quasirandom 3-graphs ⋮ Counting Hamilton cycles in Dirac hypergraphs ⋮ The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Matching of Given Sizes in Hypergraphs ⋮ Dirac-type theorems in random hypergraphs ⋮ Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs ⋮ Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs ⋮ Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture ⋮ Near Perfect Matchings in ${k}$-Uniform Hypergraphs II ⋮ A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs ⋮ Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture ⋮ The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph ⋮ Euler tours in hypergraphs ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Vertex degree sums for perfect matchings in 3-uniform hypergraphs ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu ⋮ Factors in randomly perturbed hypergraphs ⋮ On powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Covering and tiling hypergraphs with tight cycles ⋮ \(d\)-matching in 3-uniform hypergraphs ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version ⋮ Exact Minimum Codegree Threshold for K−4-Factors ⋮ Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs ⋮ Covering and tiling hypergraphs with tight cycles ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ Longest Paths in Random Hypergraphs ⋮ Matching in 3-uniform hypergraphs ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Hamilton cycles in hypergraphs below the Dirac threshold ⋮ Rainbow factors in hypergraphs ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs ⋮ Nearly Perfect Matchings in Uniform Hypergraphs ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ Hamiltonicity in randomly perturbed hypergraphs ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs ⋮ A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs
This page was built for publication: Recent advances on Dirac-type problems for hypergraphs
