𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A weighted generalization of Tur�n's theorem

✍ Scribed by Bondy, J. A.; Tuza, Zs.

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
114 KB
Volume
25
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

A short proof of K�nig's matching theore
A short proof of K�nig's matching theorem
✍ Rizzi, Romeo 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 43 KB 👁 2 views

We give a short proof of the following basic fact in matching theory: in a bipartite graph the maximum size of a matching equals the minimum size of a node cover.

On a generalization of Blaschke's Rollin
On a generalization of Blaschke's Rolling Theorem and the smoothing of surfaces
✍ Guenther Walther 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 1 views

A generalization of Blaschke's Rolling Theorem for not necessarily convex sets is proved that exhibits an intimate connection between a generalized notion of convexity, various concepts in mathematical morphology and image processing, and a certain smoothness condition. As a consequence a geometric

A simple proof of Moser's theorem
A simple proof of Moser's theorem
✍ Zhu, Xuding 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 2 views

This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.

A continuous analogue of Sperner's theor
A continuous analogue of Sperner's theorem
✍ Daniel A. Klain; Gian-Carlo Rota 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 2 views

One of the best-known results of extremal combinatorics is Sperner's theorem, which asserts that the maximum size of an antichain of subsets of an n-element set equals the binomial coefficient n n/2 , that is, the maximum of the binomial coefficients. In the last twenty years, Sperner's theorem has