ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a dd-regular graph of order nn, and let m(H,k)m(H,k) denote the number of vertices of degree kk in a spanning subgraph HH. Asymptotic degree-balance conjecture. For every dd there is a finite family Dd\mathcal{D}_d of exceptional graphs such that every dd-regular graph GG of order nn not belonging to Dd\mathcal{D}_d has a spanning subgraph HH for which, for every integer kk with 0≤k≤d0\leq k\leq d, if nd+1\frac{n}{d+1} and ⌈d2⌉\left\lceil\frac d2\right\rceil are odd integers, then

∣m(H,k)−nd+1∣≤1;\left|m(H,k)-\frac{n}{d+1}\right|\leq 1;

otherwise,

∣m(H,k)−nd+1∣≤dd+1\left|m(H,k)-\frac{n}{d+1}\right|\leq \frac{d}{d+1}

when dd is even, and

∣m(H,k)−nd+1∣≤d−1d+1\left|m(H,k)-\frac{n}{d+1}\right|\leq \frac{d-1}{d+1}

when dd is odd. This conjecture refines the degree-balance problem by asserting that, apart from finitely many exceptions for each dd, the parity obstruction is the only obstruction to attaining the bound 11. The source explicitly notes that even the case d=4d=4 is 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.