On the maximum number of edges in a hypergraph whose linegraph contains no cycle (Q1143416)

From MaRDI portal
Revision as of 23:42, 13 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the maximum number of edges in a hypergraph whose linegraph contains no cycle
scientific article

    Statements

    On the maximum number of edges in a hypergraph whose linegraph contains no cycle (English)
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    0 references
    0 references
    0 references
    0 references
    uniform hypergraph
    0 references
    almost Steiner systems
    0 references
    line graph of a hypergraph
    0 references