Egan and Nikolayevsky's conjecture on degree sequences of triangular simple graphs
Statement
Let and let be a sequence of integers satisfying
and
Here a triangular simple graph is a simple graph in which every edge is contained in a triangle. Egan and Nikolayevsky's conjecture. The sequence is the degree sequence of a triangular simple graph. This is the simple-graph degree-sequence conjecture that motivates the multigraph analogue studied in the paper; the cited authors proved it in some special cases, but the general assertion is not resolved in the supplied text.
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.