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)$ ? Is it true that $h_{G} (n) / n \to \infty$ for every graph $G$ with chromatic number $ℵ_{1}$ ?

Worked, still open.

graph theory · open · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

Let me rewrite your definition in a standard way.

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

open