ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a planar graph, and let its local track-number be the minimum number of tracks in an injective track cover such that every vertex belongs to at most that many tracks.

Local track-number conjecture. The local track-number of GG is at most 33.

The source identifies this as the only unresolved entry in its table of covering-number questions. It notes that the bound is known for bipartite planar graphs and for planar graphs of treewidth at most 33, while the general planar case 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.