ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a graph with at least 44 vertices. A graph is (3,6)(3,6)-tight when ∣E∣=3∣V∣−6|E|=3|V|-6 and every vertex subset UU with at least two vertices spans at most 3∣U∣−63|U|-6 edges. For an edge ee, write (V,S)/e(V,S)/e for the graph obtained by contracting ee. A graph HH is (2,3)(2,3)-tight when ∣E(H)∣=2∣V(H)∣−3|E(H)|=2|V(H)|-3 and every vertex subset UU with at least two vertices spans at most 2∣U∣−32|U|-3 edges.

The partition characterisation conjecture. The graph GG is (3,6)(3,6)-tight if and only if, for every edge e∈Ee\in E, there exists a partition (S1,S2,S3)(S_1,S_2,S_3) of EE such that

∣Si∣=∣V∣−ifor each i∈{1,2,3},|S_i|=|V|-i\quad\text{for each }i\in\{1,2,3\},

e∈S1e\in S_1, and each of the graphs

(V,S1∪S2),(V,S1∪S3)/e,(V,S2∪S3∪{e})/e(V,S_1\cup S_2),\qquad (V,S_1\cup S_3)/e,\qquad (V,S_2\cup S_3\cup\{e\})/e

is (2,3)(2,3)-tight.

This conjecture is proposed as a correction to a claimed combinatorial characterisation of minimal 33-rigidity. The paper presents a counterexample to the earlier characterisation and suggests that the stated partition condition may provide the appropriate characterisation; its resolution is not established here.

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.