CN-TST 2020 Problem 6
Given a simple, connected graph with vertices and edges. Prove that one can find at least ways separating the set of vertices into two parts, such that the induced subgraphs on both parts are connected.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.