Skip to main content
Article thumbnail
Location of Repository

Previous Up Next Article Citations From References: 2 From Reviews: 0

By Sauer Norbert (-calg


Another look at the Erdős-Hajnal-Pósa results on partitioning edges and the Rado graph. (English summary) Paul Erdős and his mathematics (Budapest, 1999). Combinatorica 21 (2001), no. 2, 293–308. The Rado graph R is the unique countable graph with the property that for every finite graph G and any vertex a of G, each embedding of G − a into R can be extended to an embedding of G into R. If G1,..., Gn are some graphs, then R ↣ (G1,..., Gn) e means that for every partition A1,..., An of the set of edges of the Rado graph R, for some i there is an embedding of Gi into R such that all edges of the embedded graph belong to the set Ai

Year: 2011
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.