Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs
From MaRDI portal
Publication:6568850
DOI10.1016/J.EJC.2024.103976zbMATH Open1543.05142MaRDI QIDQ6568850
Guanghui Wang, Jie Han, Lin Sun
Publication date: 8 July 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Hypergraphs (05C65) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of tessellation and tiling problems (05B45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved bounds for Erdős' matching conjecture
- The extremal function for partial bipartite tilings
- On the maximum number of edges in a hypergraph with given matching number
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- Forbidding just one intersection
- Proof of the Erdős matching conjecture in a new range
- \(K_r\)-factors in graphs with low independence number
- The Erdős matching conjecture and concentration inequalities
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- On Erdős' extremal problem on matchings in hypergraphs
- Erdős matching conjecture for almost perfect matchings
- Graph Theory
- Tiling 3-uniform hypergraphs with \(K_4^3-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
- Intersection theorems for systems of sets (III)
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Minimum Vertex Degree Threshold for ‐tiling*
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $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)
