Perfect matchings in large uniform hypergraphs with large minimum collective degree

DOI10.1016/J.JCTA.2008.10.002zbMATH Open1214.05130OpenAlexW2144292514MaRDI QIDQ1024365FDOQ1024365

Authors: Vojtěch Rödl, Andrzej Ruciński, Endre Szemerédi

Publication date: 17 June 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2008.10.002

Recommendations

Perfect matchings in uniform hypergraphs with large minimum degree
scientific article; zbMATH DE number 5720905
On perfect matchings in uniform hypergraphs with large minimum vertex degree
Perfect matchings in 3-uniform hypergraphs with large vertex degree
Near perfect matchings in $k$-uniform hypergraphs

zbMATH Keywords

minimum degree hypergraph perfect matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

Title not available (Why is that?)
A Dirac-Type Theorem for 3-Uniform Hypergraphs
Hamiltonian chains in hypergraphs
An approximate Dirac-type theorem for $k$-uniform hypergraphs
Perfect matchings in uniform hypergraphs with large minimum degree
Perfect matchings in $r$-partite $r$-graphs
Matchings in hypergraphs of large minimum degree

Cited In (93)

Packing $k$-partite $k$-uniform hypergraphs
A note on perfect matchings in uniform hypergraphs
Perfect matchings in random uniform hypergraphs
Improved bound on vertex degree version of Erdős matching conjecture
Perfect matchings in 3-partite 3-uniform hypergraphs
Covering and tiling hypergraphs with tight cycles
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Covering and tiling hypergraphs with tight cycles
Matchings in hypergraphs of large minimum degree
Dirac-type theorems in random hypergraphs
Perfect packings in quasirandom hypergraphs. I.
Nearly perfect matchings in uniform hypergraphs
Perfect matchings in uniform hypergraphs with large minimum degree
Perfect Packings in Quasirandom Hypergraphs II
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
The Erdős matching conjecture and concentration inequalities
Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
A geometric theory for hypergraph matching
Minimum vertex degree threshold for $\mathcal{C}_4^3$-tiling
Perfect matchings in hypergraphs and the Erdős matching conjecture
Hamilton cycles in hypergraphs below the Dirac threshold
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
On vertex independence number of uniform hypergraphs
Tight bounds for powers of Hamilton cycles in tournaments
On extremal hypergraphs for Hamiltonian cycles
Triangle packings and 1-factors in oriented graphs
On perfect matchings in $k$-complexes
Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
Perfect matchings in 4-uniform hypergraphs
Perfect matchings and $K_4^3$-tilings in hypergraphs of large codegree
Some Ore-type results for matching and perfect matching in $k$-uniform hypergraphs
Vertex degree sums for perfect matchings in 3-uniform hypergraphs
$d$-matching in 3-uniform hypergraphs
Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three
Dirac-type results for loose Hamilton cycles in uniform hypergraphs
Near perfect matchings in $k$-uniform hypergraphs
Families of triples with high minimum degree are Hamiltonian
On directed versions of the Hajnal-Szemerédi theorem
$d$-matching in $k$-uniform hypergraphs
Codegree thresholds for covering 3-uniform hypergraphs
Transitive triangle tilings in oriented graphs
$F$-factors in hypergraphs via absorption
On a hypergraph matching problem
Almost partitioning a 3-edge-colored $K_{n,n}$ into five monochromatic cycles
The complexity of perfect matchings and packings in dense hypergraphs
Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
Polynomial-time perfect matchings in dense hypergraphs
Matching in 3-uniform hypergraphs
Tiling 3-uniform hypergraphs with $K_4^3-2e$
The complexity of vertex coloring problems in uniform hypergraphs with high degree
Minimum degree thresholds for Hamilton $(k/2)$-cycles in $k$-uniform hypergraphs
On a Ramsey-Turán variant of the Hajnal-Szemerédi theorem
On the numbers of 1-factors and 1-factorizations of hypergraphs
Matchings in 3-uniform hypergraphs of large minimum vertex degree
Decision problem for perfect matchings in dense $k$-uniform hypergraphs
A note on exact minimum degree threshold for fractional perfect matchings
Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
On the Hamiltonicity of triple systems with high minimum degree
Forbidding Hamilton cycles in uniform hypergraphs
Graph Tilings in Incompatibility Systems
Permanents of multidimensional matrices: properties and applications
Exact minimum codegree threshold for $K^-_4$-factors
Counting Hamilton cycles in Dirac hypergraphs
Title not available (Why is that?)
Vertex degree sums for matchings in 3-uniform hypergraphs
From one to many rainbow Hamiltonian cycles
Vertex degree sums for matchings in 3-uniform hypergraphs
Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs
Packing $k$-partite $k$-uniform hypergraphs
Clique-factors in graphs with sublinear -independence number
Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
Matching of given sizes in hypergraphs
Conflict-free hypergraph matchings
A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
Embedding clique-factors in graphs with low $\ell$-independence number
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs
A Ramsey–Turán theory for tilings in graphs
$H$-factors in graphs with small independence number
A note on color-bias perfect matchings in hypergraphs
On powers of Hamilton cycles in Ramsey-Turán theory
Almost perfect matchings in $k$-partite $k$-graphs
Pseudorandom hypergraph matchings
On perfect matchings and tilings in uniform hypergraphs
Codegree threshold for tiling $k$-graphs with two edges sharing exactly $\ell$ vertices
Matchings in $k$-partite $k$-uniform hypergraphs
Compatible powers of Hamilton cycles in dense graphs
All feedback arc sets of a random Turán tournament have $\lfloor{n}/{k}\rfloor-{k}+1$ disjoint ${k}$-cliques (and this is tight)
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
Transversal Hamilton cycle in hypergraph systems
Minimum codegree threshold for $C_6^3$-factors in 3-uniform hypergraphs
Perfect fractional matchings in $k$-out hypergraphs
Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
Codegree threshold for tiling balanced complete $3$-partite $3$-graphs and generalized $4$-cycles

This page was built for publication: Perfect matchings in large uniform hypergraphs with large minimum collective degree

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