✦ LIBER ✦

Partitions of graphs into small and large sets

✍ Scribed by Bojilov, Asen; Caro, Yair; Hansberg, Adriana; Nenov, Nedyalko

Book ID: 122644760
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 453 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.02.038

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitions of planar sets into small tri

Partitions of planar sets into small triangles

✍ Andrew M Odlyzko; János Pintz; Kenneth B Stolarsky 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 440 KB

Given 3n points in the unit square, n >12, they determine n triangles whose vertices exhaust the given 3n points in many ways. Choose the n triangles so that the sum of their areas is minimal, and let a\*(n) be the maximum value of this minimum over all configurations of 3n points. Then n-~<< a\*(n)

Graph partition into small cliques

✍ Yan, Jin; Gao, Yunshu; Zhang, Beibei 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 419 KB

Partitions of graphs into one or two ind

Partitions of graphs into one or two independent sets and cliques

✍ Andreas Brandstädt 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 417 KB

It is shown in this note that it can be recognized in polynomial time whether the vertex set of a finite undirected graph can be partitioned into one or two independent sets and one or two cliques. Such graphs generalize bipartite and split graphs and the result also shows that it can be recognized

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.

Partitioning chordal graphs into indepen

Partitioning chordal graphs into independent sets and cliques

✍ Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 217 KB

We consider the following generalization of split graphs: A graph is said to be a (k; ')-graph if its vertex set can be partitioned into k independent sets and ' cliques. (Split graphs are obtained by setting k = ' = 1.) Much of the appeal of split graphs is due to the fact that they are chordal, a

Partitions of large Rado graphs

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