Abstract
Letl andk be positive integers, and letX={0,1,...,l k−1}. Is it true that for every coloring δ:X×X→{0,1,...} there either exist elementsx 0<x 1<...<x l ofX with δ(x 0,x 1)=δ(x 1,x 2)=...=δ(x l−1,x l), or else there exist elementsy 0<y 1<...<y k ofX with δ(y i−1,y i) ∈ δ(y j−1,y j) for all 1<-i<j≤k? We prove here that this is the case if eitherl≤2, ork≤4, orl≥(3k)2k. The general question remains open.
Similar content being viewed by others
References
Erdös, P., Rado, R.: A combinatorial theorem. J. London Math. Soc.,25, 249–255 (1950)
Erdös, P., Szekeres, G.: A combinatorial problem in geometry. Composito Math.2, 464–470 (1935)
Gallai, T.: On directed paths and circuits. In: Theory of Graphs (eds. P. Erdös and G. Katona), pp. 115–118. New York: Academic Press (1968)
Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc.30, 264–286 (1930)
Tuza, Zs.: Intersection properties and extremal problems for set systems. In: Irregularities of Partitions (G. Halász and V.T. Sós eds.), Algorithms and Combinatorics Vol. 8, pp. 141–151. Berlin: Springer-Verlag (1989)
Author information
Authors and Affiliations
Additional information
Supported by DFG-Deutsche Forschungsgemeinschaft
Rights and permissions
About this article
Cite this article
Lefmann, H., Rödl, V. & Thomas, R. Monochromatic Vs multicolored paths. Graphs and Combinatorics 8, 323–332 (1992). https://doi.org/10.1007/BF02351589
Received:
Revised:
Issue date:
DOI: https://doi.org/10.1007/BF02351589

