ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an nn-vertex graph. A bipartite cut is a cut whose induced subgraph on one side is bipartite. Bogdanov–Neustroeva–Sokolov–Volostnov–Russkin–Voronov conjecture. Any nn-vertex graph with fewer than 3n−63n-6 edges admits a bipartite cut, while some graphs with 3n−63n-6 edges do not. In particular, ℓ3=3\ell_3=3. This is the next case after the resolved case ℓ2=2\ell_2=2; the conjecture is open, with partial progress on related forest-cut and bipartite-cut bounds.

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.