Kong's modulo-8 conjecture for near-perfect matchings of odd square grids
Statement
Let be the total number of near-perfect matchings of the grid, and write
Kong's modulo- conjecture. For all , the integer is congruent to modulo .
This is presented as a further conjecture of Kong after the paper proves only that is odd; its status is not resolved in the supplied text.
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.