Skip to main content
SpringerLink
Log in

A note on monotone paths in labeled graphs

  • Notes
  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics Faculty of Nuclear Science and Physical Engineering, Technical University of Prague, Trojanova 13, 120 000, Prague 2, Czechoslovakia

    Jan Reiterman

Authors
  1. Jan Reiterman
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02124684

AMS subject classification (1980)

Search

Navigation