The structure of hypergraphs without long Berge cycles (Q1998768): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Erdős-Gallai type theorem for uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding long Berge cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph extensions of the Erdős-Gallai theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-uniform hypergraphs with circumference less than \(r\) / rank
 
Normal rank

Latest revision as of 17:19, 24 July 2024

scientific article
Language Label Description Also known as
English
The structure of hypergraphs without long Berge cycles
scientific article

    Statements

    The structure of hypergraphs without long Berge cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 March 2021
    0 references
    Berge cycles
    0 references
    Berge paths
    0 references
    extremal hypergraphs
    0 references

    Identifiers

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