✦ LIBER ✦

Partitions of large Rado graphs

✍ Scribed by M. Džamonja; J. A. Larson; W. J. Mitchell

Publisher: Springer
Year: 2009
Tongue: English
Weight: 377 KB
Volume: 48
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-009-0138-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge partitions of the Rado graph

✍ Maurice Pouzet; Norbert Sauer 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 804 KB

Partitioning random graphs into large cy

Partitioning random graphs into large cycles

✍ A.M. Frieze 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 833 KB

Let r 3 1 be a tied positive integer. We give the limiting distribution for the probability that the vertices of a random graph can be partitioned equitably into I cycles.

COLORING SUBGRAPHS OF THE RADO GRAPH

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

Star partitions of graphs

✍ Egawa, Y.; Kano, M.; Kelmans, Alexander K. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 78 KB 👁 2 views

Let G be a graph and n ≥ 2 an integer. We prove that the following are equivalent: (i) there is a partition , and (ii) for every subset S of V (G), G \ S has at most n|S| components with the property that each of their blocks is an odd order complete graph.

Judicious partitions of graphs

✍ B. Bollobás; A. D. Scott 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 474 KB

Complete partitions of graphs

✍ Magnús M. Halldórsson; Guy Kortsarz; Jaikumar Radhakrishnan; Sivaramakrishnan Si 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 393 KB