Dong–Luo Conjecture on Tight (k,0)-Stable Graphs
Statement
There exists an integer such that, for every integer , every graph of order satisfying for every subset with and is isomorphic to either or , where denotes the independence number of .
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.