Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs

DOI10.1002/jgt.22988zbMath1522.05344arXiv2109.00722MaRDI QIDQ6081575

Jie Han, Guang-Hui Wang, Lin Sun, Luyining Gan

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.00722

zbMATH Keywords

hypergraphHamilton cycleabsorbing methodhypergraph regularity method

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Combinatorial aspects of tessellation and tiling problems (05B45) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• The extremal function for partial bipartite tilings
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• On the maximum number of edges in a hypergraph with given matching number
• Forbidding Hamilton cycles in uniform hypergraphs
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• Loose Hamilton cycles in hypergraphs
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Dirac-type results for loose Hamilton cycles in uniform hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
• Forbidding just one intersection
• Proof of the Erdős matching conjecture in a new range
• Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version
• On Hamiltonian cycles in hypergraphs with dense link graphs
• Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs
• Dirac-type theorems in random hypergraphs
• The Erdős matching conjecture and concentration inequalities
• Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• On extremal problems of graphs and generalized graphs
• On Erdős' extremal problem on matchings in hypergraphs
• Erdős matching conjecture for almost perfect matchings
• Tiling 3-Uniform Hypergraphs With K43−2e
• On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
• The Size of a Hypergraph and its Matching Number
• On maximal paths and circuits of graphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Degrees giving independent edges in a hypergraph
• Intersection theorems for systems of sets (III)
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Hamiltonian chains in hypergraphs
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
• Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
• A Density Corrádi–Hajnal Theorem
• Minimum Vertex Degree Threshold for ‐tiling*
• Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Some Theorems on Abstract Graphs
• Minimum degree conditions for tight Hamilton cycles

This page was built for publication: Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs