Regularity conjecture for graphs with lexicographically optimal Cartesian squares
Statement
Let be a graph, and consider the Cartesian square . An ordering of the vertices is optimal for the edge-isoperimetric problem (EIP) when it minimizes the number of boundary edges among vertex sets of each prescribed size. The lexicographic order on tuples is defined by declaring greater than if, for some , one has for and . Regularity conjecture. If the lexicographic order is optimal for , then is regular. The conjecture seeks to characterize graphs for which the lexicographic order is optimal on all Cartesian powers. The local-global principle shows that optimality for implies optimality for for every , but no general method is known for establishing optimality on Cartesian squares of concrete graphs.
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.