We consider the following problem. Fixed a graph H and a real number α ∈ (0, 1], determine the smallest β = β(α, H) satisfying the following property: if G is a graph of order n such that every subset of αn vertices spans more that βn 2 edges then G contains H as a subgraph. This problem was initiated and motivated by Erdős who conjectured that every triangle-free graph of order n contains a subset of n/2 vertices that spans at most n 2 /50 edges. Our main result shows that i) every triangle-and pentagon-free graph of order n contains a subset of n/2 vertices inducing at most n 2 /64 edges and, ii) if G is a triangle-free regular graph of order n with degree exceeding n/3 then G contains a subset of n/2 vertices inducing at most n 2 /50 edges. Furthermore, if G is not 3-chromatic then G contains a subset of n/2 vertices inducing less than n 2 /54 edges. As a by-product and confirming a conjecture of Erdős asymptotically, we obtain that every n-vertex triangle-free regular graph with degree exceeding n/3 can be made bipartite by removing at most (1/25 + o(1))n 2 edges. We also provide a counterexample to a conjecture of Erdős, Faudree, Rousseau and Schelp.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.