Abstract
In this paper we show that there exists a constant C>0 such that for any graph G on Cklnk vertices either G or its complement G¯ has an induced subgraph on k vertices with minimum degree at least ½(k−1). This affirmatively answers a question of Erdős and Pach from 1983.
Original language | English |
---|---|
Pages (from-to) | 991-999 |
Number of pages | 9 |
Journal | Bulletin of the London Mathematical Society |
Volume | 49 |
Issue number | 6 |
Early online date | 6 Oct 2017 |
DOIs | |
Publication status | Published - 1 Dec 2017 |
Keywords
- 05C55 (primary)
- 05D10
- 05D40 (secondary)