𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the maximum density of graphs which have no subcontraction to K3

✍ Scribed by W. Fernandez De la Vega


Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
57 KB
Volume
46
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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}