ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G(n,m)G(n,m) denote the class of graphs with nn vertices and mm edges. For r=1kr=\frac{1}{k}, let nn be a multiple of kk, and let COe1/k(G)CO^{1/k}_{e}(G) and COe1/k+(G(n,m))CO^{1/k^+}_{e}(G(n,m)) denote the proportional edge connectivity of a graph and the maximum such value over G(n,m)G(n,m), respectively. A failure state is the graph obtained after removing an edge disconnecting set.

Equal-component failure-state conjecture. There exists G∈G(n,m)G\in G(n,m) such that

COe1/k(G)=COe1/k+(G(n,m))CO^{1/k}_{e}(G)=CO^{1/k^+}_{e}(G(n,m))

and the failure state of GG can be written as the union of kk components of order nk\frac{n}{k}.

The conjecture is intended to describe the structure of an extremal failure state and is used to seek upper bounds through bipartite subgraphs of graph complements. The source gives no resolution, so its status remains open.

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.