Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
From MaRDI portal
Publication:1014811
DOI10.1007/s00373-008-0787-7zbMath1205.05184OpenAlexW2034679949MaRDI QIDQ1014811
Publication date: 29 April 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-008-0787-7
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Perfect packings in quasirandom hypergraphs. I., Matching of Given Sizes in Hypergraphs, Dirac-type theorems in random hypergraphs, Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs, Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture, Fractional and integer matchings in uniform hypergraphs, Near Perfect Matchings in ${k}$-Uniform Hypergraphs II, The Erdős matching conjecture and concentration inequalities, Vertex degree sums for perfect matchings in 3-uniform hypergraphs, Packing \(k\)-partite \(k\)-uniform hypergraphs, Perfect matchings in 3-partite 3-uniform hypergraphs, \(d\)-matching in 3-uniform hypergraphs, Perfect matchings in 4-uniform hypergraphs, Permanents of multidimensional matrices: Properties and applications, d-matching in k-uniform hypergraphs, Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels, Near Perfect Matchings ink-Uniform Hypergraphs, A note on perfect matchings in uniform hypergraphs, Almost Perfect Matchings in $k$-Partite $k$-Graphs, Perfect Packings in Quasirandom Hypergraphs II, Exact minimum degree thresholds for perfect matchings in uniform hypergraphs, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs, Families of triples with high minimum degree are Hamiltonian, Polynomial-time perfect matchings in dense hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On Perfect Matchings and Tilings in Uniform Hypergraphs, Note on matchings in 3-partite 3-uniform hypergraphs, Matching in 3-uniform hypergraphs, Forbidding Hamilton cycles in uniform hypergraphs, Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, Unnamed Item, Unnamed Item, The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree, The complexity of perfect matchings and packings in dense hypergraphs, Powers of tight Hamilton cycles in randomly perturbed hypergraphs, A geometric theory for hypergraph matching, Vertex degree sums for matchings in 3-uniform hypergraphs, A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs, \(F\)-factors in hypergraphs via absorption, Minimum Vertex Degree Threshold for ‐tiling*, Tiling 3-Uniform Hypergraphs With K43−2e
Cites Work
- Perfect matchings in uniform hypergraphs with large minimum degree
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Concentration of measure and isoperimetric inequalities in product spaces
- Concentration for Independent Permutations
- Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
- Matchings in hypergraphs of large minimum degree
- Unnamed Item
- Unnamed Item
