On the density of 2-colorable 3-graphs i
β
Klas MarkstrΓΆm; John Talbot
π
Article
π
2009
π
John Wiley and Sons
π
English
β 161 KB
π 1 views
## Abstract Let __ex__~2~(__n, K__) be the maximum number of edges in a 2βcolorable __K__βfree 3βgraph (where __K__={123, 124, 134} ). The 2βchromatic TurΓ‘n density of __K__ is \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$\pi\_{2}({K}\_{4}^-) =lim\_{{n}\to \infty} {ex}\_{2}