Bickle’s conjecture on collapsible graphs
Statement
For every pair of integers and , the minimum of over all graphs of order satisfying and for every nonempty proper induced subgraph of is , where such a graph is called -collapsible.
Record
- Added
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.