ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph is critical with tree-depth kk if its tree-depth is kk and every proper minor has smaller tree-depth. The maximum degree of a graph GG is denoted by δ(G)\delta(G).

The maximum-degree conjecture. Every critical graph with tree-depth kk has maximum degree at most

k−1.k-1.

The bound is proved for the class of 11-unique critical graphs, and several classes of critical graphs are known to lie in that class. Whether every critical graph satisfies the bound remains 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.