\(F\)-factors in hypergraphs via absorption
From MaRDI portal
Publication:2345534
DOI10.1007/s00373-014-1410-8zbMath1312.05099arXiv1105.3411MaRDI QIDQ2345534
Publication date: 22 May 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.3411
05C35: Extremal problems in graph theory
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C07: Vertex degrees
Related Items
On Perfect Matchings and Tilings in Uniform Hypergraphs, Covering and tiling hypergraphs with tight cycles, On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition, Dirac-type results for tilings and coverings in ordered graphs, Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles, Perfect Packings in Quasirandom Hypergraphs II, Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs, Exact Minimum Codegree Threshold for K−4-Factors, A geometric theory for hypergraph matching, Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree, Transversal Ck-factors in subgraphs of the balanced blow-up of Ck, Embedding clique-factors in graphs with low \(\ell\)-independence number, Graph Tilings in Incompatibility Systems, Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu, Clique-factors in graphs with sublinear -independence number, F$F$‐factors in Quasi‐random Hypergraphs, A Ramsey–Turán theory for tilings in graphs, A degree sequence Hajnal-Szemerédi theorem, Perfect packings in quasirandom hypergraphs. I., Exact minimum degree thresholds for perfect matchings in uniform hypergraphs, Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs, Packing \(k\)-partite \(k\)-uniform hypergraphs, A note on perfect matchings in uniform hypergraphs, Covering and tiling hypergraphs with tight cycles, Powers of Hamiltonian cycles in multipartite graphs, Tilings in vertex ordered graphs, Dirac-type theorems in random hypergraphs, Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles, The complexity of perfect matchings and packings in dense hypergraphs, Cyclic triangle factors in regular tournaments, Tiling multipartite hypergraphs in quasi-random hypergraphs, Codegree Thresholds for Covering 3-Uniform Hypergraphs, Triangle factors of graphs without large independent sets and of weighted graphs, Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs, The Complexity of Perfect Packings in Dense Graphs, TILING DIRECTED GRAPHS WITH TOURNAMENTS, Near Perfect Matchings in ${k}$-Uniform Hypergraphs II, Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial and computational aspects of graph packing and graph decomposition
- Supersaturated graphs and hypergraphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Perfect matchings in 4-uniform hypergraphs
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- The minimum independence number for designs
- Minimum codegree threshold for \((K^3_4-e)\)-factors
- Matchings in 3-uniform hypergraphs
- On extremal problems of graphs and generalized graphs
- On the chromatic number of set systems
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- Tiling 3-Uniform Hypergraphs With K43−2e
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Embedding large subgraphs into dense graphs
- On uncrowded hypergraphs
- A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
- Matchings in hypergraphs of large minimum degree
- A geometric theory for hypergraph matching
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
