Color count conjecture for highly colorable maps
Statement
Let . Define to be the four largest possible numbers of valid color vectors, modulo the action of on the colors, among tree pairs corresponding to maps in and having internal vertices each, with
Let denote the Jacobsthal numbers, and write for when is even and when is odd. Color count conjecture. The following hold:
These formulas are based on computational observations about the numbers of colorings of maps in . The authors state that they are unable to determine the quantities in general and present these formulas as conjectural estimates; the supplied text gives no resolution.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.