✦ LIBER ✦

A generalization of the ray-chaudhuri-wilson theorem

✍ Scribed by Hunter S. Snevily

Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 161 KB
Volume: 3
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.3180030505

No coin nor oath required. For personal study only.

✦ Synopsis

Let K = {Itl,. . . , k,} and L ={I1,. . . , Z,} be two sets of non-negative integers and assume ki > l j for every i , j . Let T be an L-intersecting family of subsets of a set of n elements. Assume the size of every set in T is a number from K. We conjecture that 1 ' f l 5 (: ). We prove that our conjecturer is true for any K. (with min ki 2 s) when L = (0, 1, ..., s -l}. We also show that for any K and any L , (with min ki > max l j ) , 5 ( " T I ) -k (:I;) + _._ 4-( , ! &: ,

) .

📜 SIMILAR VOLUMES

A generalization of Plantholt's theorem

✍ A. J. W. Hilton 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

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)/(__

A Generalization of the normal Basis The

A Generalization of the normal Basis Theorem

✍ David J. Winter 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

Generalization of a Theorem of Alexandro

Generalization of a Theorem of Alexandroff

✍ T.V. Panchapagesan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 271 KB

A Generalization of a Theorem of Dirac

✍ Tristan Denley; Haidong Wu 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 85 KB

In this paper, we give a generalization of a well-known result of Dirac that given any k vertices in a k-connected graph where k 2, there is a circuit containing all of them. We also generalize a result of Ha ggkvist and Thomassen. Our main result partially answers an open matroid question of Oxley.

On a generalization of Rubin's theorem

✍ Dmitry A. Shabanov 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB

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.