Triangle-intersecting families of graphs
Triangle-intersecting families of graphs
A family \mathcal F of graphs is triangle-intersecting if for every G,H\in\mathcal F , G \cap H contains a triangle. A conjecture of Simonovits and Sós from 1976 states that the largest triangle-intersecting families of graphs on a fixed set of n vertices are those obtained by fixing a specific …