On the maximum number of edges in a hypergraph whose linegraph contains no cycle - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics Year : 1980

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

(1) , , (2)
1
2
Fichier principal
Vignette du fichier
43-BFS80-hypergaph.pdf (1.98 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02379954 , version 1 (26-11-2019)

Identifiers

Cite

Jean-Claude Bermond, Peter Frankl, Francois Sterboul. On the maximum number of edges in a hypergraph whose linegraph contains no cycle. Discrete Mathematics, 1980, 30, pp.295-298. ⟨10.1016/0012-365X(80)90237-X⟩. ⟨hal-02379954⟩
27 View
176 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More