𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximating Monochromatic Triangles in a Two-Colored Plane

✍ Scribed by M. J. Nielsen

Book ID
110236393
Publisher
Akadmiai Kiad
Year
1997
Tongue
English
Weight
255 KB
Volume
74
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Monochromatic triangles in two-colored p
Monochromatic triangles in two-colored plane
✍ VΓ­t JelΓ­nek; Jan Kynčl; Rudolf StolaΕ™; TomΓ‘Ε‘ Valla πŸ“‚ Article πŸ“… 2009 πŸ› Springer-Verlag 🌐 English βš– 583 KB
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