Minimum vertex degree threshold for C₄^3-tiling
From MaRDI portal
Publication:5265336
Abstract: We prove that the vertex degree threshold for tiling (the 3-uniform hypergraph with four vertices and two triples) in a 3-uniform hypergraph on vertices is , where if and otherwise. This result is best possible, and is one of the first results on vertex degree conditions for hypergraph tiling.
Recommendations
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
- Tight minimum degree condition for the existence of loose cycle tilings in 3-graphs
- Tiling 3-uniform hypergraphs with K₄^3-2e
- A degree sequence strengthening of the vertex degree threshold for a perfect matching in 3-uniform hypergraphs
- Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles
Cites work
- \(H\)-factors in dense graphs
- A geometric theory for hypergraph matching
- An approximate Dirac-type theorem for k-uniform hypergraphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Extremal problems on set systems
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Matchings in 3-uniform hypergraphs
- Minimum codegree threshold for (K^3_4-e)-factors
- Perfect matchings and K₄^3-tilings in hypergraphs of large codegree
- Perfect matchings in 3-uniform hypergraphs with large vertex degree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Proof of the Alon-Yuster conjecture
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Tight co-degree condition for perfect matchings in 4-graphs
- Tiling 3-uniform hypergraphs with K₄^3-2e
Cited in
(10)- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On perfect matchings and tilings in uniform hypergraphs
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
- Tight minimum degree condition for the existence of loose cycle tilings in 3-graphs
- Minimum codegree threshold for \(C_6^3\)-factors in 3-uniform hypergraphs
- Exact minimum codegree threshold for K^-_4-factors
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
- Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs
- Packing k-partite k-uniform hypergraphs
This page was built for publication: Minimum vertex degree threshold for \(\mathcal{C}_4^3\)-tiling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265336)
