𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Perfect 2-Colorings of Johnson Graphs J(v,3)

✍ Scribed by Alexander L. Gavrilyuk; Sergey V. Goryainov

Book ID
115558649
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
618 KB
Volume
21
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the greatest number of 2 and 3 colori
On the greatest number of 2 and 3 colorings of a (v, e)-graph
✍ Felix Lazebnik 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 446 KB

Let 9 denote the family of simple undirected graphs on u vertices having e edges ( ( u , el-graphs) and P(A, G ) be the chromatic polynomial of a graph G. For the given integers u, e, A, let f b , e, A) denote the greatest number of proper colorings in A or less colors that a (u, e)-graph G can have

On the density of 2-colorable 3-graphs i
On the density of 2-colorable 3-graphs in which any four points span at most two edges
✍ 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}