Kozerenko–Skochko imbalance conjecture
Statement
Let be a finite simple graph, and for each edge define its imbalance by . Suppose that for every . Then the multiset is graphic; that is, there exists a finite simple graph whose multiset of vertex degrees is .
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.