Exact minimum degree thresholds for perfect matchings in uniform hypergraphs (Q439060): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2134792353 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1210.7356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in \(r\)-partite \(r\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight co-degree condition for perfect matchings in 4-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees giving independent edges in a hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic solution of a Turán-type problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph regularity and the multidimensional Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hypergraph Turán problem of Frankl / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in 4-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in hypergraphs of large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in 3-partite 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(F\)-factors in hypergraphs via absorption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3078214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in uniform hypergraphs with large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in large uniform hypergraphs with large minimum collective degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the regularity lemma for uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank

Latest revision as of 11:59, 5 July 2024

scientific article
Language Label Description Also known as
English
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
scientific article

    Statements

    Exact minimum degree thresholds for perfect matchings in uniform hypergraphs (English)
    0 references
    0 references
    0 references
    1 August 2012
    0 references
    absorbing method
    0 references
    hypergraph removal lemma
    0 references
    0 references
    0 references
    0 references

    Identifiers