Abstract
AbstractWe give a slight improvement on the size of a monochromatic double star we can guarantee in every r-coloring of the edges of $$K_n$$
K
n
.
Funder
ELKH Alfréd Rényi Institute of Mathematics
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. Erdős, P., Faudree, R., Gyárfás, A., Schelp, R.H.: Domination in colored complete graphs. J. Graph Theory 13, 713–718 (1989)
2. Füredi, Z.: Maximum degree and fractional matchings in uniform hypergraphs. Combinatorica 1, 155–162 (1981)
3. Grossman, J.W., Harary, F., Klawe, M.: Generalized Ramsey theory for graphs. X. Double stars. Discrete Math. 28, 247–254 (1979)
4. Gyárfás, A., Sárközy, G.N.: Size of monochromatic double stars in edge colorings. Graphs Combinatorics 24, 531–536 (2008)
5. Gyárfás, A.: Partition coverings and blocking sets in hypergraphs (in Hungarian). Commun. Comput. Auto. Inst. Hungarian Acad. Sci. 71, 62 pp (1977)