𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a generalization of Rubin's theorem

✍ Scribed by Dmitry A. Shabanov

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
89 KB
Volume
67
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

The work is devoted to the calculation of asymptotic value of the choice number of the complete r-partite graph K m * r = K m,. ..,m with equal part size m. We obtained the asymptotics in the case ln r = o(ln m). The proof generalizes the classical result of A.L. Rubin for the case r = 2.

📜 SIMILAR VOLUMES

A generalization of Turán's theorem
A generalization of Turán's theorem
✍ Benny Sudakov; Tibor Szabó; H. Van Vu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract In this paper, we obtain an asymptotic generalization of Turán's theorem. We prove that if all the non‐trivial eigenvalues of a __d__‐regular graph __G__ on __n__ vertices are sufficiently small, then the largest __K__~__t__~‐free subgraph of __G__ contains approximately (__t__ − 2)/(__

Another Generalization of Lindström's Th
Another Generalization of Lindström's Theorem on Subcubes of a Cube
✍ Uwe Leck 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 185 KB

We consider the poset P ðN ; A 1 ; A 2 ; . . . ; A m Þ consisting of all subsets of a finite set N which do not contain any of the A i 's, where the A i 's are mutually disjoint subsets of N : The elements of P are ordered by inclusion. We show that P belongs to the class of Macaulay posets, i.e. we

A weighted generalization of Tur�n's the
A weighted generalization of Tur�n's theorem
✍ Bondy, J. A.; Tuza, Zs. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 2 views

We obtain a generalization of Turán's theorem for graphs whose edges are assigned integer weights. We also characterize the extremal graphs in certain cases.

A generalization of a Ramsey-type theore
A generalization of a Ramsey-type theorem on hypermatchings
✍ Paul Baginski 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB

## Abstract For an __r__‐uniform hypergraph __G__ define __N__(__G__, __l__; 2) (__N__(__G__, __l__; ℤ~__n__~)) as the smallest integer for which there exists an __r__‐uniform hypergraph __H__ on __N__(__G__, __l__; 2) (__N__(__G__,__l__; ℤ~__n__~)) vertices with clique(__H__) < __l__ such that eve