Triangular realisation conjecture for graphical degree sequences
Statement
A graphical degree sequence is a finite sequence of nonnegative integers realised as the degree sequence of a finite simple graph. A graph is triangular if every edge belongs to a -cycle.
Triangular realisation conjecture. Any graphical sequence all of whose terms are greater than or equal to admits a triangular realisation.
The conjecture proposes a degree threshold guaranteeing a realisation in which every edge lies in a triangle. The paper establishes the conjecture for a class of biregular graphical degree sequences, while the general case remains open.
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.