ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a plane graph GG, let g(G)g(G) denote the length of the shortest face in GG. For a (not necessarily proper) kk-coloring of V(G)V(G) we say that a face is polychromatic if all kk colors appear on its vertices. A k-coloring of V(G)V(G) is called polychromatic if every face of GG is polychromatic. The polychromatic number of GG, denoted by p(G)p(G), is the largest number kk such that there is a polychromatic kk-coloring of V(G)V(G). Define p(g)=min⁡{p(G)∣g(G)=g}p(g)=\min\{p(G)|g(G)=g\}. Determine p(g)p(g) exactly for every positive integer gg. The first open case is g=5g=5 where we know that 2≤p(5)≤42 \leq p(5) \leq 4.

Record

Added
Links

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.