ProbXiv
Explorersign in
Problem archiveProblem record

Statement

The report poses three open questions in online graph-coloring games: can the vertex/edge-coloring threshold theorem be generalized from two colors to any r≥2 colors; does the lower-bound formula based on the parameter m₁(F) give the correct threshold for every vertex-coloring game; and what happens if Painter receives r vertices or edges per step and must use each color exactly once among them?

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.