For r\geq2 and d\geq1, determine the maximum number of independent sets in a d-regular r-uniform hypergraph on n vertices; in particular, does the canonical d-regular…
Statement
For r\geq2 and d\geq1, determine the maximum number of independent sets in a d-regular r-uniform hypergraph on n vertices; in particular, does the canonical d-regular hypergraph H_d^r give the conjectured bound ind(G)\leq ind(H_d^r)^{n/(rd)}?
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.