Minimum Vertex Degree Threshold for ‐tiling* (Q5265336): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: \(H\)-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling 3-Uniform Hypergraphs With K43−2e / 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: Extremal problems on set systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric theory for hypergraph matching / 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: Proof of the Alon-Yuster conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton \(\ell \)-cycles in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamilton cycles in 3-uniform hypergraphs of high 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: Minimum codegree threshold for \((K^3_4-e)\)-factors / 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: An approximate Dirac-type theorem for \(k\)-uniform hypergraphs / 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: Regular Partitions of Hypergraphs: Regularity Lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II / rank
 
Normal rank

Latest revision as of 13:54, 10 July 2024

scientific article; zbMATH DE number 6463680
Language Label Description Also known as
English
Minimum Vertex Degree Threshold for ‐tiling*
scientific article; zbMATH DE number 6463680

    Statements

    Minimum Vertex Degree Threshold for ‐tiling* (English)
    0 references
    0 references
    0 references
    0 references
    23 July 2015
    0 references
    0 references
    graph packing
    0 references
    hypergraph
    0 references
    absorbing method
    0 references
    regularity lemma
    0 references
    0 references
    0 references