Recent advances on Dirac-type problems for hypergraphs

From MaRDI portal
Publication:2957178

DOI10.1007/978-3-319-24298-9_6zbMath1354.05100arXiv1508.06170OpenAlexW1923478559MaRDI QIDQ2957178

Yi Zhao

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




Related Items (47)

Hamiltonicity in cherry-quasirandom 3-graphsCounting Hamilton cycles in Dirac hypergraphsThe Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹Matching of Given Sizes in HypergraphsDirac-type theorems in random hypergraphsHamilton \(\ell\)-cycles in randomly perturbed hypergraphsSome Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphsPerfect Matchings in Hypergraphs and the Erdös Matching ConjectureNear Perfect Matchings in ${k}$-Uniform Hypergraphs IIA Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform HypergraphsDegree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjectureThe minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraphEuler tours in hypergraphsThe Erdős matching conjecture and concentration inequalitiesVertex degree sums for perfect matchings in 3-uniform hypergraphsAnti-Ramsey Number of Matchings in 3-Uniform HypergraphsTilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐VuFactors in randomly perturbed hypergraphsOn powers of tight Hamilton cycles in randomly perturbed hypergraphsLoose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp versionGraph and hypergraph colouring via nibble methods: a surveyCovering and tiling hypergraphs with tight cycles\(d\)-matching in 3-uniform hypergraphsMinimum degree conditions for tight Hamilton cyclesProperly colored Hamilton cycles in Dirac-type hypergraphsTiling multipartite hypergraphs in quasi-random hypergraphsLoose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate VersionExact Minimum Codegree Threshold for K4-FactorsMinimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphsCovering and tiling hypergraphs with tight cyclesOn Perfect Matchings and Tilings in Uniform HypergraphsMinimum vertex degree thresholds for tiling complete 3-partite 3-graphsLongest Paths in Random HypergraphsMatching in 3-uniform hypergraphsOn Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ The complexity of perfect matchings and packings in dense hypergraphsHamilton cycles in hypergraphs below the Dirac thresholdRainbow factors in hypergraphsCodegree Thresholds for Covering 3-Uniform HypergraphsTwo problems on matchings in set families -- in the footsteps of Erdős and KleitmanMinimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphsNearly Perfect Matchings in Uniform HypergraphsTight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphsTriangle-degrees in graphs and tetrahedron coverings in 3-graphsHamiltonicity in randomly perturbed hypergraphsVertex degree sums for matchings in 3-uniform hypergraphsA 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