Another look at the Erdos-Hajnal-Posa results on partitioning edges of theRado graph

Authors
Sauer, N
Citation
N. Sauer, Another look at the Erdos-Hajnal-Posa results on partitioning edges of theRado graph, COMBINATORI, 21(2), 2001, pp. 293-308
Citations number
3
Categorie Soggetti
Mathematics,"Computer Science & Engineering
Journal title
COMBINATORICA
ISSN journal
02099683 → ACNP
Volume
21
Issue
2
Year of publication
2001
Pages
293 - 308
Database
ISI
SICI code
0209-9683(2001)21:2<293:ALATER>2.0.ZU;2-V
Abstract
Erdos, Hajnal and Posa exhibited in [1] a partition (U, D) of the edges of the Rado graph R which is a counterexarnple to R>--> (R)(2)(edges). They al so obtained that if every vertex of a graph G has either in G or in the com plement of G finite degree then R>-->,(G, R)edges We will characterize all graphs G(1),G(2),...,G(n) so that R>--> (G(1), G(2),..., G(n))(edges).