Frankl, Péter and Kato, M. and Katona, Gyula and Tokushige, N. (2013) Twocolorings with many monochromatic cliques in both colors. JOURNAL OF COMBINATORIAL THEORY SERIES B, 103 (4). pp. 415427. ISSN 00958956

Text
Twocolorings with many monochromatic cliques in both colors.pdf Download (149kB)  Preview 
Official URL: http://www.sciencedirect.com/science/article/pii/S...
Abstract
Color the edges of the nvertex complete graph in red and blue, and suppose that red kcliques are fewer than blue kcliques. We show that the number of red kcliques is always less than cknk, where ck∈(0, 1) is the unique root of the equation zk=(1z)k+kz(1z)k1. On the other hand, we construct a coloring in which there are at least cknkO(nk1) red kcliques and at least the same number of blue kcliques. © 2013 Elsevier Inc.
Item Type:  Article 

Uncontrolled Keywords:  Young diagram; Unimodal sequence; Ramsey theory; Edge coloring 
Subjects:  Q Science / természettudomány > QA Mathematics / matematika 
SWORD Depositor:  MTMT SWORD 
Depositing User:  MTMT SWORD 
Date Deposited:  11 Dec 2013 07:16 
Last Modified:  11 Dec 2013 07:16 
URI:  http://real.mtak.hu/id/eprint/7988 
Actions (login required)
Edit Item 