Journal title
BULLETIN OF THE LONDON MATHEMATICAL SOCIETY
DOI
10.1112/blms.12094
Issue
6
Volume
49
Last updated
2019-04-28T04:10:18.88+01:00
Page
991-999
Abstract
© 2017 London Mathematical Society We affirmatively answer a question of Erdős and Pach from 1983 by showing the following: there is some constant C > 0 such that for any graph G on Ck In k vertices either G or its complement (Formula presented.) has an induced subgraph on k vertices with minimum degree at least 1/2 (k − 1).
Symplectic ID
730243
Download URL
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000417922600005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=4fd6f7d59a501f9b8bac2be37914c43e
Submitted to ORA
On
Publication type
Journal Article
Publication date
December 2017