𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds for coverings of pairs by large blocks

✍ Scribed by D. T. Todorov


Publisher
Springer-Verlag
Year
1989
Tongue
English
Weight
402 KB
Volume
9
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A sharp lower bound for the circumferenc
✍ Vu Dinh Hoa πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 207 KB πŸ‘ 1 views

## Abstract We show that every 1‐tough graph __G__ on __n__ β‰₯ 3 vertices with Οƒ~3~≧ __n__ has a cycle of length at least min{__n, n__ + (Οƒ~3~/3 ) βˆ’ Ξ± + 1}, where Οƒ~3~ denotes the minimum value of the degree sum of any 3 pairwise nonadjacent vertices and Ξ± the cardinality of a miximum independent se