Skip to main content
SpringerLink
Log in

Another Look at the Erdős–Hajnal–Pósa Results on Partitioning Edges of the Rado Graph

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

Dedicated to the memory of Paul Erdős

Erdős, Hajnal and Pósa exhibited in [1] a partition (U,D) of the edges of the Rado graph which is a counterexample to . They also obtained that if every vertex of a graph has either in or in the complement of finite degree then .

We will characterize all graphs so that .

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

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Calgary; 2500 University Dr., N.W. Calgary, Alberta T2N 1N4, Canada; E-mail: nsauer@math.ucalgary.ca, , , , , , CA

    Norbert Sauer

Authors
  1. Norbert Sauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received October 29, 1999

RID="†"

ID="†" Supported by NSERC of Canada Grant #691325.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sauer, N. Another Look at the Erdős–Hajnal–Pósa Results on Partitioning Edges of the Rado Graph. Combinatorica 21, 293–308 (2001). https://doi.org/10.1007/s004930100026

Download citation

  • Issue Date:

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

Search

Navigation