Bogdanov–Neustroeva–Sokolov–Volostnov–Russkin–Voronov conjecture for bipartite cuts
Statement
Let be an -vertex graph. A bipartite cut is a cut whose induced subgraph on one side is bipartite. Bogdanov–Neustroeva–Sokolov–Volostnov–Russkin–Voronov conjecture. Any -vertex graph with fewer than edges admits a bipartite cut, while some graphs with edges do not. In particular, . This is the next case after the resolved case ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.