Hypergraphs of bounded disjointness
A κ-uniform hypergraph is s-almost intersecting if every edge is disjoint from exactly s other edges. Gerbner et al. [SIAM J. Discrete Math., 26 (2012), pp. 1657 1669] conjectured that for every κ, and s s0(κ), every k-uniform s-almost intersecting hypergraph has at most (s+1)(2k-2 k-1 edges. We pro...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
Society for Industrial and Applied Mathematics
2014
|