Hypergraphs of bounded disjointness
Abstract
A k-uniform hypergraph is s-almost intersecting if every edge is disjoint from exactly s other edges. We prove a strengthened version of this conjecture and determine the extremal graphs. We also give some related results and conjectures.
Repository Citation
Alex Scott and Elizabeth Wilmer. 2014. "Hypergraphs of bounded disjointness." SIAM Journal on Discrete Mathematics 28(1): 372-384.
Publisher
Society for Industrial and Applied Mathematics
Publication Date
1-1-2014
Publication Title
SIAM Journal on Discrete Mathematics
Department
Mathematics
Document Type
Article
DOI
https://dx.doi.org/10.1137/130925670
Keywords
Extremal set theory, Intersection theorems, Hypergraphs, Multihypergraphs
Language
English
Format
text
COinS
