Perfect matchings in large uniform hypergraphs with large minimum collective degree

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

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

Cites work

scientific article; zbMATH DE number 1540669 (Why is no real title available?)
A Dirac-Type Theorem for 3-Uniform Hypergraphs
An approximate Dirac-type theorem for $k$-uniform hypergraphs
Hamiltonian chains in hypergraphs
Matchings in hypergraphs of large minimum degree
Perfect matchings in $r$-partite $r$-graphs
Perfect matchings in uniform hypergraphs with large minimum degree

Cited in

(93)

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

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)