ProbXiv
Explorersign in
Problem archiveProblem record

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 33-cycle.

Triangular realisation conjecture. Any graphical sequence all of whose terms are greater than or equal to 44 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.