The edge-isoperimetric conjecture for the permutahedron at size 6^(n+1)/3
Statement
Let be the permutahedron graph, and let denote the minimum edge-expansion among subsets of of size . Set
Edge-isoperimetric conjecture for the permutahedron.
This conjecture asserts that the heuristic construction using a Cartesian product of copies of the -cycle gives the optimal edge expansion at this scale. The surrounding discussion does not provide a proof or a resolution.
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.