Name
Abstract | ||
|---|---|---|
Color the edges of the n-vertex complete graph in red and blue, and suppose that red k-cliques are fewer than blue k-cliques. We show that the number of red k-cliques is always less than c"kn^k, where c"k@?(0,1) is the unique root of the equation z^k=(1-z)^k+kz(1-z)^k^-^1. On the other hand, we construct a coloring in which there are at least c"kn^k-O(n^k^-^1) red k-cliques and at least the same number of blue k-cliques. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.jctb.2013.04.002 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
red k-cliques,unique root,blue k-cliques,n-vertex complete graph,monochromatic clique,edge coloring,ramsey theory | Ramsey theory,Complete graph,Edge coloring,Complete coloring,Monochromatic color,Combinatorics,Mathematics | Journal |
Volume | Issue | ISSN |
103 | 4 | 0095-8956 |
Citations | PageRank | References |
1 | 0.41 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Frankl | 1 | 578 | 126.03 |
| Mitsuo Kato | 2 | 1 | 0.75 |
| Gyula O. H. Katona | 3 | 264 | 66.44 |
| Norihide Tokushige | 4 | 200 | 32.44 |