The two-thirds excess conjecture for hypergraph r-cuts
Statement
Let be a -graph with edges. For fixed parameters satisfying , with or , let an -cut be a partition of the vertex set into parts, and let its size be the number of edges having a vertex in every part. Let denote the Stirling number of the second kind.
Two-thirds excess conjecture. Every -graph has an -cut of size
The paper proves a lower bound with exponent and constructs examples with excess , so this conjecture would close the gap between the two bounds. The parameter range and quantifiers are reproduced as stated in the source.
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.