𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A GENERALIZATION OF LINDENBAUM'S THEOREM FOR PREDICATE CALCULI

✍ Scribed by Konrad Schultz

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
230 KB
Volume
30
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ 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)/(__

A short proof for a generalization of Vi
A short proof for a generalization of Vizing's theorem
✍ Claude Berge; Jean Claude Fournier πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 183 KB πŸ‘ 1 views

## Abstract For a simple graph of maximum degree Ξ”, it is always possible to color the edges with Ξ” + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, Ξ” colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these re

On a generalization of Rubin's theorem
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.