𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Monochromatic triangles in two-colored plane

✍ Scribed by Vít Jelínek; Jan Kynčl; Rudolf Stolař; Tomáš Valla

Book ID
106167715
Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
583 KB
Volume
29
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Special monochromatic trees in two-color
Special monochromatic trees in two-colored complete graphs
✍ Chen, Guantao; Schelp, Richard H.; ?olt�s, ?ubom�r 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB 👁 2 views

For a positive integer k, a set of k + 1 vertices in a graph is a k-cluster if the difference between degrees of any two of its vertices is at most k -1. Given any tree T with at least k 3 edges, we show that for each graph G of sufficiently large order, either G or its complement contains a copy of

The number of edge colorings with no mon
The number of edge colorings with no monochromatic triangle
✍ Yuster, Raphael 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 639 KB

Let F(n, k) denote the maximum number of t w o edge colorings of a graph on n vertices that admit no monochromatic Kk. la complete graph on k vertices). The following results are proved: f ( n , 3) = 2Ln2/41 for all n 2 6. f ( n , k) = 2((k~2)/(2k-2)+o( 1))n'. In particular, the first result solves