Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings
type: Item
instance of: scholarly article
title: Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings
zbMATH Open document ID: 0939.05034
author: V. Rosta
published in: The Electronic Journal of Combinatorics
publication date: 2000-05-11T00:00:00Z
full work available at URL: https://eudml.org/doc/120351
full work available at URL: v7i1n3.html
review text: 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.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1446391
zbMATH Keywords: Elekes's conjecture
zbMATH Keywords: colored graphs
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1446391