Number of lines in hypergraphs
Pierre Aboulker, Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan,, Va\v{s}ek Chv\'atal, Peihan Miao

TL;DR
This paper improves the lower bound on the number of lines in 3-uniform hypergraphs, showing they have at least twice as many lines as previously established, which advances understanding of hypergraph structure.
Contribution
The authors significantly strengthen the lower bound on the number of lines in 3-uniform hypergraphs, nearly doubling the previous logarithmic bound.
Findings
At least $rac{1}{2} imes ext{(previous bound)}$ lines in 3-uniform hypergraphs
Improved the theoretical lower bound by a factor of $2-o(1)$
Advances the combinatorial understanding of hypergraph line structures
Abstract
Chen and Chv\'atal introduced the notion of lines in hypergraphs; they proved that every 3-uniform hypergraph with vertices either has a line that consists of all vertices or else has at least distinct lines. We improve this lower bound by a factor of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Computational Geometry and Mesh Generation
