✦ LIBER ✦

A generalization of Plantholt's theorem

✍ Scribed by A. J. W. Hilton

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 152 KB
Volume: 10
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190100410

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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.

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.

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 LINDENBAUM'S THEOREM

A GENERALIZATION OF LINDENBAUM'S THEOREM FOR PREDICATE CALCULI

✍ Konrad Schultz 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 230 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.