Partitioning 3-colored complete graphs into three monochromatic cycles.
Gyárfás, András; Ruszinkó, Miklós; Sarközy, Gábor N.; Szemerédi, Endre
The Electronic Journal of Combinatorics [electronic only] (2011)
- Volume: 18, Issue: 1, page Research Paper P53, 16 p., electronic only-Research Paper P53, 16 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topGyárfás, András, et al. "Partitioning 3-colored complete graphs into three monochromatic cycles.." The Electronic Journal of Combinatorics [electronic only] 18.1 (2011): Research Paper P53, 16 p., electronic only-Research Paper P53, 16 p., electronic only. <http://eudml.org/doc/231887>.
@article{Gyárfás2011,
author = {Gyárfás, András, Ruszinkó, Miklós, Sarközy, Gábor N., Szemerédi, Endre},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research Paper P53, 16 p., electronic only-Research Paper P53, 16 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Partitioning 3-colored complete graphs into three monochromatic cycles.},
url = {http://eudml.org/doc/231887},
volume = {18},
year = {2011},
}
TY - JOUR
AU - Gyárfás, András
AU - Ruszinkó, Miklós
AU - Sarközy, Gábor N.
AU - Szemerédi, Endre
TI - Partitioning 3-colored complete graphs into three monochromatic cycles.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2011
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 18
IS - 1
SP - Research Paper P53, 16 p., electronic only
EP - Research Paper P53, 16 p., electronic only
LA - eng
UR - http://eudml.org/doc/231887
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.