ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a subcubic graph, meaning that every vertex of GG has degree at most 33, and let χ2(G)\chi_{2}(G) denote its 2-ranking number. The 2-ranking conjecture for subcubic graphs. If GG is subcubic, then

χ2(G)≤6\chi_{2}(G)\le 6

and equality holds if and only if GG is the cubic graph obtained from C8C_8 by joining vertices at distance 44. The surrounding discussion notes that the Petersen and Heawood graphs, despite being plausible candidates, admit 2-rankings with only 5 ranks; the stated classification identifies the remaining extremal graph.

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.