ProbXiv
Explorersign in
Problem archiveProblem record

Statement

If GG is a graph let hG(n)h_G(n) be defined such that any subgraph of GG on nn vertices can be made bipartite after deleting at most hG(n)h_G(n) edges. What is the behaviour of hG(n)h_G(n)? Is it true that hG(n)/n→∞h_G(n)/n\to \infty for every graph GG with chromatic number ℵ1\aleph_1?

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.