ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with maximum degree 44, and let TT be a backbone tree. Write BBCλ(G,T)BBC_{\lambda}(G,T) for the minimum number of colors in a λ\lambda-backbone coloring. Extremal tree-coloring conjecture. There is no graph GG with maximum degree 44 and no backbone tree TT such that either

BBC3(G,T)=8BBC_3(G,T)=8

or

BBCλ(G,T)=λ+6BBC_{\lambda}(G,T)=\lambda+6

for some λ≥4\lambda \ge 4. This concerns whether the upper bounds for backbone tree coloring in maximum-degree-four graphs are best possible; the source presents these extremal cases as unresolved.

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.