On a Ramsey-type problem of Erdős and Pach

Ross Kang, Eoin Long, Viresh Patel, Guus Regts

Research output: Contribution to journalArticlepeer-review

205 Downloads (Pure)

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 languageEnglish
Pages (from-to)991-999
Number of pages9
JournalBulletin of the London Mathematical Society
Volume49
Issue number6
Early online date6 Oct 2017
DOIs
Publication statusPublished - 1 Dec 2017

Keywords

  • 05C55 (primary)
  • 05D10
  • 05D40 (secondary)

Fingerprint

Dive into the research topics of 'On a Ramsey-type problem of Erdős and Pach'. Together they form a unique fingerprint.

Cite this