Abstract

Erdős, Faudree, Rousseau and Schelp observed the following fact for every fixed integer k≥2: Every graph on n≥k−1 vertices with at least (k−1)(n−k+2)+(k−22) edges contains a subgraph with minimum degree at least k. However, there are examples in which the whole graph is the only such subgraph. Erdős et al. conjectured that having just one more edge implies the existence of a subgraph on at most (1−εk)n vertices with minimum degree at least k, where εk>0 depends only on k. We prove this conjecture, using and extending ideas of Mousset, Noever and Škorić.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.