Triangle-intersecting families on eight vertices
Combinatorics
2011-02-10 v1
Abstract
Simonovits and S\'{o}s conjectured that the maximal size of a triangle-intersecting family of graphs on vertices is . Their conjecture has recently been proved using spectral methods. We provide an elementary proof of the special case of vertices using a partition argument.
Cite
@article{arxiv.1102.1764,
title = {Triangle-intersecting families on eight vertices},
author = {Yuval Filmus},
journal= {arXiv preprint arXiv:1102.1764},
year = {2011}
}