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

DOI10.1016/0012-365X(80)90237-XzbMath0442.05051OpenAlexW2070905991MaRDI QIDQ1143416

F. Sterboul, Jean-Claude Bermond, Peter Frankl

Publication date: 1980

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(80)90237-x

zbMATH Keywords

uniform hypergraphalmost Steiner systemsline graph of a hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph theory (05C99)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: On the maximum number of edges in a hypergraph whose linegraph contains no cycle