Author
Conlon, D
Fox, J
Journal title
DISCRETE & COMPUTATIONAL GEOMETRY
DOI
10.1007/s00454-018-9980-5
Issue
1
Volume
61
Last updated
2019-10-01T02:27:14.467+01:00
Page
218-225
Abstract
© 2018, The Author(s). Let ℓ m be a sequence of m points on a line with consecutive points of distance one. For every natural number n, we prove the existence of a red/blue-coloring of E n containing no red copy of ℓ 2 and no blue copy of ℓ m for any m≥ 2 cn . This is best possible up to the constant c in the exponent. It also answers a question of Erdős et al. (J Comb Theory Ser A 14:341–363, 1973). They asked if, for every natural number n, there is a set K⊂ E 1 and a red/blue-coloring of E n containing no red copy of ℓ 2 and no blue copy of K.
Symplectic ID
824946
Download URL
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000463139600012&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=4fd6f7d59a501f9b8bac2be37914c43e
Publication type
Journal Article
Publication date
January 2019
Please contact us with feedback and comments about this page. Created on 17 Feb 2018 - 17:30.