Fractional decompositions of dense hypergraphs (Q3429620): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hall's theorem for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hypergraph matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near perfect coverings in graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and fractional packings in dense 3‐uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically good list-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing hypergraphs into simple hypertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions / rank
 
Normal rank

Latest revision as of 15:44, 25 June 2024

scientific article
Language Label Description Also known as
English
Fractional decompositions of dense hypergraphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references