A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge

@article{Kostochka2013AHV,
  title={A Hypergraph Version of a Graph Packing Theorem by Bollob{\'a}s and Eldridge},
  author={Alexandr V. Kostochka and Christopher Stocker and Peter Hamburger},
  journal={Journal of Graph Theory},
  year={2013},
  volume={74},
  pages={222-235}
}
Two n-vertex hypergraphs G and H pack, if there is a bijection f : V (G) → V (H) such that for every edge e ∈ E(G), the set {f(v) : v ∈ e} is not an edge in H . Extending a theorem by Bollobás and Eldridge on graph packing to hypergraphs, we show that if n ≥ 10 and n-vertex hypergraphs G and H with |E(G)|+ |E(H)| ≤ 2n− 3 with no edges of size 0, 1, n− 1 and n do not pack, then either (i) one of G and H contains a spanning graph-star, and each vertex of the other is contained in a graph edge, or… CONTINUE READING