ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥3n\geq 3 and let (d1,…,dn)(d_1,\ldots,d_n) be a sequence of integers satisfying

d1≥⋯≥dn≥4,d_1\geq\cdots\geq d_n\geq 4, d1+⋯+dn is even,d_1+\cdots+d_n\text{ is even},

and

∑i=1kdi≤k(k−1)+∑i=k+1nmin⁡{di,k}for every k∈[n].\sum_{i=1}^k d_i\leq k(k-1)+\sum_{i=k+1}^n\min\{d_i,k\}\quad\text{for every }k\in[n].

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 (d1,…,dn)(d_1,\ldots,d_n) 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 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.