On the minimal monochromatic K4-density
Combinatorics
2011-11-21 v4
Abstract
We use Razborov's flag algebra method to show a new asymptotic lower bound for the minimal density of monochromatic 's in any 2-coloring of the edges of the complete graph on vertices. The hitherto best known lower bound was obtained by Giraud, who proved that m_4>1/46, whereas the best known upper bound by Thomason states that m_4<1/33. We can show that m_4>1/35.
Cite
@article{arxiv.1106.1030,
title = {On the minimal monochromatic K4-density},
author = {Konrad Sperfeld},
journal= {arXiv preprint arXiv:1106.1030},
year = {2011}
}