Abstract
LetV fin andE fin resp. denote the classes of graphsG with the property that no matter how we label the vertices (edges, resp.) ofG by members of a linearly ordered set, there will exist paths of arbitrary finite lengths with monotonically increasing labels. The classesV inf andE inf are defined similarly by requiring the existence of an infinite path with increasing labels. We proveE inf ⫋V inf ⫋V fin ⫋E fin. Finally we consider labellings by positive integers and characterize the class corresponding toV inf.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. G. de Bruijn andP. Erdős, A color problem for infinite graphs and a problem in the theory of relations,Indag. Math. 13 (1951), 369–373.
T. Gallai, On directed paths and circuits, in:Theory of Graphs (P. Erdös and G. Katona, eds.), Academic Press 1968.
R. L. Graham andD. J. Kleitman, Increasing paths in edge ordered graphs,Periodica Mathematica Hungarica 3 (1973), 141–148.
F. P. Ramsey, On a problem of formal logic,Proc. Lond. Math. Soc. (2)30 (1930), 264–286.
V. Rödl, Generalization of the Ramsey Theorem and Dimension of Graphs, (in Czech),Thesis, Charles University, Prague (1973).