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

Jean-Claude Bermond; Peter Frankl; Francois Sterboul

doi:10.1016/0012-365X(80)90237-X

Journal Articles Discrete Mathematics Year : 1980

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

(1) , , (2)

1
2

Jean-Claude Bermond

Function : Author
PersonId : 739520
IdHAL : jean-claude-bermond

Laboratoire de Recherche en Informatique

Peter Frankl

Function : Author

Francois Sterboul

Function : Author

Université de Lille, Sciences et Technologies

Domains

Computer Science [cs] Discrete Mathematics [cs.DM] Computer Science [cs] Data Structures and Algorithms [cs.DS] Computer Science [cs] Networking and Internet Architecture [cs.NI] Computer Science [cs] Operations Research [cs.RO] Computer Science [cs] Social and Information Networks [cs.SI]

Fichier principal

43-BFS80-hypergaph.pdf (1.98 Mo)

Origin : Files produced by the author(s)

Jean-Claude Bermond : Connect in order to contact the contributor

https://hal.inria.fr/hal-02379954

Submitted on : Tuesday, November 26, 2019-1:24:07 AM

Last modification on : Sunday, June 26, 2022-12:12:59 PM

Dates and versions

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

Identifiers

HAL Id : hal-02379954 , version 1
DOI : 10.1016/0012-365X(80)90237-X

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⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

EC-PARIS CNRS UMR8623 TDS-MACS

27 View

176 Download

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

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share