Minimum-order conjecture for odd and even D(k) graphs
Statement
Let and denote the odd- and even-parity graphs constructed in the paper, with order parameter .
Minimum-order conjecture. For all , there exists no for all and for all .
The authors construct such graphs for all in the odd case and all in the even case, and conjecture that these orders are minimal. The claim remains open.
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.