Minimum polychromatic number for plane graphs with fixed girth
Statement
For a plane graph , let denote the length of the shortest face in . For a (not necessarily proper) -coloring of we say that a face is polychromatic if all colors appear on its vertices. A k-coloring of is called polychromatic if every face of is polychromatic. The polychromatic number of , denoted by , is the largest number such that there is a polychromatic -coloring of . Define . Determine exactly for every positive integer . The first open case is where we know that .
Record
- Source
- Added
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.