The sharp lower-bound conjecture for multicolor Hamming graphs
Let denote the -ary Hamming graph, and let denote its bipartite independence-related parameter as defined in the paper. Fix an integer . Sharp-bound conjecture. For sufficiently large ,
The surrounding discussion says that the author could not extend Alon's argument to for , suggesting that the lower bound in the main theorem may be improvable. Thus the proposed equality is not established in the supplied text.
References
- Norihide Tokushige, “Alon's transmitting problem and multicolor Beck–Spencer Lemma”, arXiv:2406.19945 (2025).
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.