A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree k

2017/05/28 by Sauermann, Lisa
#05C07 #05C35 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1705.09979

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-2\choose 2 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ć.

Related

• Smaller subgraphs of minimum degree k
• On the minimal degree condition of graphs implying some properties of subgraphs
• Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
• Graphs without proper subgraphs of minimum degree 3 and short cycles
• Degree conditions for embedding trees