Abstract
Erdős posed the problem of finding conditions on a graph that imply the largest number of edges in a triangle-free subgraph is equal to the largest number of edges in a bipartite subgraph. We generalize this problem to general cases. Let be the least number so that any graph on vertices with minimum degree has the property where is the largest number of edges in an -partite subgraph and is the largest number of edges in a -free subgraph. We show that when In particular,
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.