Erdős Problem #111 — If G is a graph let h_G(n) be defined such that any subgraph of G on n vertices can be made bipartite after deleting at most h_G(n) edges. What is the behaviour of h_G(n)?
Statement
If is a graph let be defined such that any subgraph of on vertices can be made bipartite after deleting at most edges. What is the behaviour of ? Is it true that for every graph with chromatic number ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.