Large Y₃,2-tilings in 3-uniform hypergraphs

Combinatorial aspects of tessellation and tiling problems (05B45) Enumeration in graph theory (05C30) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
Perfect matchings and K₄^3-tilings in hypergraphs of large codegree
On perfect matchings and tilings in uniform hypergraphs
Tiling 3-uniform hypergraphs with K₄^3-2e
A stability result on matchings in 3-uniform hypergraphs

Cites work

$K_r$-factors in graphs with low independence number
Dirac-type results for loose Hamilton cycles in uniform hypergraphs
Erdős matching conjecture for almost perfect matchings
Forbidding just one intersection
Graph theory
scientific article; zbMATH DE number 3523543 (Why is no real title available?)
scientific article; zbMATH DE number 3641497 (Why is no real title available?)
scientific article; zbMATH DE number 3221072 (Why is no real title available?)
Improved bounds for Erdős' matching conjecture
Intersection theorems for systems of sets (III)
Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
Minimum codegree threshold for Hamilton $\ell$-cycles in $k$-uniform hypergraphs
Minimum vertex degree threshold for $\mathcal{C}_4^3$-tiling
Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
On Erdős' extremal problem on matchings in hypergraphs
On maximal paths and circuits of graphs
On the maximum number of edges in a hypergraph with given matching number
On the maximum number of edges in a triple system not containing a disjoint family of a given size
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
Proof of the Erdős matching conjecture in a new range
SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
The Erdős matching conjecture and concentration inequalities
The extremal function for partial bipartite tilings
The size of a hypergraph and its matching number
Tiling 3-uniform hypergraphs with K₄^3-2e

Cited in

(2)

Toward a density Corrádi-Hajnal theorem for degenerate hypergraphs
Minimum degree conditions for Hamilton l-cycles in k-uniform hypergraphs

This page was built for publication: Large $Y_{3,2}$-tilings in 3-uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568850)