A note on monotone paths in labeled graphs


We characterize countable graphs with the property that every one-to-one labeling of edges by positive integers admits a monotone path.

This is a preview of subscription content, access via your institution.


  1. [1]

    V. Müller andV. Rödl, Monotone paths in ordered graphs,Combinatorica,2 (1982), 193–201.

    Google Scholar 

Download references

Author information



Rights and permissions

Reprints and Permissions

About this article

Cite this article

Reiterman, J. A note on monotone paths in labeled graphs. Combinatorica 9, 231–232 (1989). https://doi.org/10.1007/BF02124684

Download citation

AMS subject classification (1980)

  • 05 C 38