Admissibility criterion for perfect 2-colorings of Hamming graphs
For fixed parameters , , and , call admissible if there is an integer such that a -coloring of exists if and only if . Assume . Admissibility criterion. The parameters , , and are admissible if and only if
for some . The preceding results provide necessary conditions and establish the threshold formulation; the stated equivalence is put forward on the basis of those results and computations, and remains open.
References
- Evgeny A. Bespalov, Denis S. Krotov, Aleksandr A. Matiushev, Anna A. Taranenko and Konstantin V. Vorob'ev, “Perfect 2-colorings of Hamming graphs”, arXiv:1911.13151 (2021).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.