Erdős Problem #127 — Excess edges in a guaranteed bipartite subgraph
Statement
For an integer , let be the largest integer such that every graph with edges contains a bipartite subgraph with at least edges. Is
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.