Clique-covering bound for relation graphs of shifted quadratic ideals
Statement
Let , , be a prime, and let be a non-degenerate quadratic form. Let be the relation graph of a subset of . If and , then \\#_{\mathrm{cc}}(G)=O_{d,\\#_{\mathrm{dd}}(G)}(1). Clique-covering bound for relation graphs. The conjecture asserts that relation graphs arising from subsets of shifted quadratic ideals cannot exhibit the large gap between clique-covering number and density dependence number seen in general graphs. The source gives no resolution, so the conjecture 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.