Note on Gy. Elekes's Conjectures Concerning Unavoidable Patterns in Proper Colorings

A counterexample is presented to Gy. Elekes's conjecture concerning the existence of long 2-colored paths in properly colored graphs. A modified version of the conjecture is given and its connections to a problem of Erdos - Gy

• Type: Journal
• Year: 2000
• Where: COMBINATORICS
• Authors: Vera Rosta
• Keywords: 2-colored Path, COMBINATORICS 2000, Complete Graph Kn, Conjecture