ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C\mathcal C be a monotone nowhere dense class of graphs. A pp-subdivision is obtained by replacing every edge of a graph by a path of length p+1p+1.

Structural conjecture for nowhere dense classes. If C\mathcal C does not have bounded expansion, then there exists an integer pp such that C\mathcal C includes pp-subdivisions of graphs with arbitrarily large chromatic number and girth.

This conjecture would provide the structural input needed to extend the paper's characterization of first-order definable colorings from the proved cases to all hereditary addable topologically closed classes. Its status is presented as open in the paper.

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.