𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hypersimple sets with retraceable complements

✍ Scribed by A. N. Degtev

Publisher
Springer US
Year
1971
Tongue
English
Weight
521 KB
Volume
10
Category
Article
ISSN
0002-5232

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Large cliques or stable sets in graphs w
Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement
✍ Maria Chudnovsky; Yori Zwols πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 312 KB

## Abstract ErdΕ‘s and Hajnal [Discrete Math 25 (1989), 37–52] conjectured that, for any graph __H__, every graph on __n__ vertices that does not have __H__ as an induced subgraph contains a clique or a stable set of size __n__^Ι›(__H__)^ for some Ι›(__H__)>0. The Conjecture 1. known to be true for gr