ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, define its Ore-degree by

Θ(G):=max⁡{d(x)+d(y):xy∈E(G)}.\Theta(G):=\max\{d(x)+d(y):xy\in E(G)\}.

A graph is SE kk-choosable if every kk-list assignment admits a strongly equitable list coloring. Strongly equitable Ore-degree conjecture. If

2k>Θ(G),2k>\Theta(G),

then GG is SE kk-choosable. This is proposed as the strongly equitable analogue of the Ore-degree list-coloring conjecture.

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.