Lines in hypergraphs

Laurent Beaudou, Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vašek Chvátal, Nicolas Fraiman, Yori Zwols

Research output: Contribution to journalArticle

5 Scopus citations

Abstract

One of the De Bruijn-Erdo{double acute}s theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a single hyperedge equals the whole vertex set, the number of hyperedges is at least the number of vertices and the two numbers are equal if and only if the hypergraph belongs to one of simply described families, near-pencils and finite projective planes. Chen and Chvátal proposed to define the line uv in a 3-uniform hypergraph as the set of vertices that consists of u, v, and all w such that {u;v;w} is a hyperedge. With this definition, the De Bruijn-Erdo{double acute}s theorem is easily seen to be equivalent to the following statement: If no four vertices in a 3-uniform hypergraph carry two or three hyperedges, then, except in the perverse case where one of the lines equals the whole vertex set, the number of lines is at least the number of vertices and the two numbers are equal if and only if the hypergraph belongs to one of two simply described families. Our main result generalizes this statement by allowing any four vertices to carry three hyperedges (but keeping two forbidden): the conclusion remains the same except that a third simply described family, complements of Steiner triple systems, appears in the extremal case.

Original languageEnglish (US)
Pages (from-to)633-654
Number of pages22
JournalCombinatorica
Volume33
Issue number6
DOIs
StatePublished - Dec 2013
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Lines in hypergraphs'. Together they form a unique fingerprint.

  • Cite this

    Beaudou, L., Bondy, A., Chen, X., Chiniforooshan, E., Chudnovsky, M., Chvátal, V., Fraiman, N., & Zwols, Y. (2013). Lines in hypergraphs. Combinatorica, 33(6), 633-654. https://doi.org/10.1007/s00493-013-2910-5