Covering and tiling hypergraphs with tight cycles (Q1689974): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On circuits in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal problems of graphs and generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codegree Thresholds for Covering 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric theory for hypergraph matching / 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: \(F\)-factors in hypergraphs via absorption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing \(k\)-partite \(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: Recent advances on Dirac-type problems for hypergraphs / rank
 
Normal rank

Revision as of 23:16, 14 July 2024

scientific article
Language Label Description Also known as
English
Covering and tiling hypergraphs with tight cycles
scientific article

    Statements

    Identifiers

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