✦ LIBER ✦

Edge partitions of the Rado graph

✍ Scribed by Maurice Pouzet; Norbert Sauer

Publisher: Springer-Verlag
Year: 1996
Tongue: English
Weight: 804 KB
Volume: 16
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01271269

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Another Look at the Erdős–Hajnal–Pósa Re

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

✍ Norbert Sauer 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 221 KB

Partitions of large Rado graphs

✍ M. Džamonja; J. A. Larson; W. J. Mitchell 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 377 KB

Partitioning the edges of a graph

✍ A.J.W Hilton; Rhys Price Jones 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Partitioning multi-edge graphs

✍ Ravi Varadarajan 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 781 KB

COLORING SUBGRAPHS OF THE RADO GRAPH

✍ N. W. Sauer* 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 300 KB

Edge-connectivity in p-partite graphs

✍ Lutz Volkmann 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

Let G = (V, €1 be a finite, simple p-partite graph with minimum degree 6 and edge-connectivity A. It is proved that if IVI d (2pS)/(p -1) -2 or in special cases that if IVI I ( 2 p 6 ) / ( p -1) -1, then A = S . It is further shown that this result is best possible.