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

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

Jean-Claude Bermond ¹ Peter Frankl Francois Sterboul ²

1 LRI - Laboratoire de Recherche en Informatique

2 Université de Lille - Faculté des Sciences et Technologies

Document type :

Journal articles

Domain :

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]

Complete list of metadata

https://hal.inria.fr/hal-02379954
Contributor : Jean-Claude Bermond <>
Submitted on : Tuesday, November 26, 2019 - 1:24:07 AM
Last modification on : Thursday, July 8, 2021 - 3:50:04 AM

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

File

Identifiers

Collections

Citation

Export

Metrics

59

488

Contact Legal Notice Personal Data

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

File

Identifiers

Collections

Citation

Export

Share

Metrics

59

488

Contact Legal Notice Personal Data