๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Chromatic numbers of spaces with forbidden monochromatic triangles

โœ Scribed by Raigorodskii, A. M.; Samirov, D. V.


Book ID
120048930
Publisher
SP MAIK Nauka/Interperiodica
Year
2013
Tongue
English
Weight
624 KB
Volume
93
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Chromatic numbers of metric spaces
โœ A. M. Raigorodskii ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Springer US ๐ŸŒ English โš– 112 KB
The number of edge colorings with no mon
โœ 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