A note on $G$-intersecting families

Consider a graph $G$ and a $k$-uniform hypergraph $\mathcal{H}$ on common vertex set $[n]$. We say that $\mathcal{H}$ is $G$-intersecting if for every pair of edges in $X,Y \in \mathcal{H}$ there are vertices $x \in X$ and $y \in Y$ such that $x = y$ or $x$ and $y$ are joined by an edge in $G$. This notion was introduced by Bohman, Frieze, Ruszinkó and Thoma who proved a natural generalization of the Erdős-Ko-Rado Theorem for $G$-intersecting $k$-uniform hypergraphs for $G$ sparse and $k = O( n^{1/4} )$. In this note, we extend this result to $k = O\left( \sqrt{n} \right)$.

No reviews yet.

No comments yet.