ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a minimally Rd{\cal R}_d-connected graph, meaning that G−eG-e is not Rd{\cal R}_d-connected for every edge e∈E(G)e\in E(G). The graph Kd+2K_{d+2} denotes the complete graph on d+2d+2 vertices.

Edge-bound conjecture. One has

∣E∣≤(d+1)∣V∣−(d+22),|E|\leq (d+1)|V|-\binom{d+2}{2},

with equality if and only if G=Kd+2G=K_{d+2}.

The cases d=1,2d=1,2 were settled in the cited work of Jear, while the general-dimensional assertion is the subject of the conjecture.

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.