ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and consider the Cartesian square G×GG\times G. 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 (x1,…,xn)(x_1,\dots,x_n) greater than (y1,…,yn)(y_1,\dots,y_n) if, for some ii, one has xj=yjx_j=y_j for 1≤j<i1\leq j<i and xi>yix_i>y_i. Regularity conjecture. If the lexicographic order is optimal for G×GG\times G, then GG 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 G×GG\times G implies optimality for GnG^n for every n≥3n\geq 3, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.