Hypergraphs of bounded disjointness
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.
Alex Scott and Elizabeth Wilmer. 2014. "Hypergraphs of bounded disjointness." SIAM Journal on Discrete Mathematics 28(1): 372-384.
Society for Industrial and Applied Mathematics
SIAM Journal on Discrete Mathematics
Extremal set theory, Intersection theorems, Hypergraphs, Multihypergraphs