𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the ratio of maximum and minimum degree in maximal intersecting families

✍ Scribed by Zoltán Lóránt Nagy; Lale Özkahya; Balázs Patkós; Máté Vizer

Book ID
118259332
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
206 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Class 1 conditions depending on the mini
Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
✍ Thomas Niessen; Lutz Volkmann 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 694 KB

## Abstract A graph is called Class 1 if the chromatic index equals the maximum degree. We prove sufficient conditions for simple graphs to be Class 1. Using these conditions we improve results on some edge‐coloring theorems of Chetwynd and Hilton. We also improve a theorem concerning the 1‐factori

On the largest tree of given maximum deg
On the largest tree of given maximum degree in a connected graph
✍ Y. Caro; I. Krasikov; Y. Roditty 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 1 views

## Abstract We prove that every connected graph __G__ contains a tree __T__ of maximum degree at most __k__ that either spans __G__ or has order at least __k__δ(__G__) + 1, where δ(__G__) is the minimum degree of __G.__ This generalizes and unifies earlier results of Bermond [1] and Win [7]. We als