Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings (Q1977407)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings |
scientific article; zbMATH DE number 1446391
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings |
scientific article; zbMATH DE number 1446391 |
Statements
Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings (English)
0 references
11 May 2000
0 references
Summary: 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 Erdős-Gyárfás and to Szemerédi's theorem are examined.
0 references
Elekes's conjecture
0 references
colored graphs
0 references
