Perfect matchings in uniform hypergraphs with large minimum degree
From MaRDI portal
Recommendations
- On perfect matchings in uniform hypergraphs with large minimum vertex degree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Perfect matchings in 3-uniform hypergraphs with large vertex degree
- Near perfect matchings in \(k\)-uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
Cites work
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Hamiltonian chains in hypergraphs
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Matching theory
- Matchings in hypergraphs of large minimum degree
- Perfect matchings in \(\varepsilon\)-regular graphs
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(74)- Perfect matchings and K₄^3-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Almost perfect matchings in random uniform hypergraphs
- Nearly perfect matchings in regular simple 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
- On the number of nearly perfect matchings in almost regular uniform hypergraphs
- A condition for matchability in hypergraphs
- The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree
- Matchings in 3-uniform hypergraphs
- \(K_r\)-factors in graphs with low independence number
- Matching in 3-uniform hypergraphs
- Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach
- Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs
- Rainbow matchings for 3-uniform hypergraphs
- Maximum size of a graph with given fractional matching number
- A note on exact minimum degree threshold for fractional perfect matchings
- Dirac-type theorems in random hypergraphs
- The Erdős matching conjecture and concentration inequalities
- The complexity of perfect matchings and packings in dense hypergraphs
- Vertex degree sums for matchings in 3-uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture
- Perfect fractional matchings in \(k\)-out hypergraphs
- Families of triples with high minimum degree are Hamiltonian
- On a hypergraph matching problem
- Perfect matchings in \(r\)-partite \(r\)-graphs
- Co-degree density of hypergraphs
- Asymptotics for Shamir's problem
- Perfect matchings in 3-uniform hypergraphs with large vertex degree
- Matchings in 3-uniform hypergraphs of large minimum vertex degree
- Decision problem for perfect matchings in dense k-uniform hypergraphs
- Perfect matchings in hypergraphs and the Erdős matching conjecture
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On perfect matchings in \(k\)-complexes
- On perfect matchings in uniform hypergraphs with large minimum vertex degree
- scientific article; zbMATH DE number 5720905 (Why is no real title available?)
- On vertex independence number of uniform hypergraphs
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
- \(d\)-matching in \(k\)-uniform hypergraphs
- Almost perfect matchings in \(k\)-partite \(k\)-graphs
- On perfect matchings and tilings in uniform hypergraphs
- Polynomial-time perfect matchings in dense hypergraphs
- Perfect matchings in random s‐uniform hypergraphs
- Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three
- Nearly perfect matchings in uniform hypergraphs
- Matching of given sizes in hypergraphs
- Rainbow perfect matchings for 4-uniform hypergraphs
- Forbidding Hamilton cycles in uniform hypergraphs
- Near perfect matchings in \(k\)-uniform hypergraphs
- Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs
- Matchings in hypergraphs of large minimum degree
- Polynomial-time perfect matchings in dense hypergraphs
- A geometric theory for hypergraph matching
- Hypergraphs without non-trivial intersecting subgraphs
- Co-degree threshold for rainbow perfect matchings in uniform hypergraphs
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs
- An existence theorem of perfect matching on k-partite k-uniform hypergraphs via distance spectral radius
- Conflict-free hypergraph matchings
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Vertex degree sums for matchings in 3-uniform hypergraphs
- A note on color-bias perfect matchings in hypergraphs
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs
- Matchings in multipartite hypergraphs
- Codegree conditions for (fractional) Steiner triple systems
- Spanning Euler tours in hypergraphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Perfect matchings in 4-uniform hypergraphs
- A note on perfect matchings in uniform hypergraphs
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
This page was built for publication: Perfect matchings in uniform hypergraphs with large minimum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q850084)
