Lower Bounds on Intersection Families for Certain Graphs

Paul Hamrick, Gary Hu

A family of graphs $\mathcal{F}$ is $H$-intersecting if the edge intersection of any two graphs in $\mathcal{F}$ contains a copy of a fixed graph $H$. A fundamental problem is to d…