ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (G,σ)(G,\sigma) be a signed connected simple subcubic graph, where v(G)v(G) denotes the number of vertices of GG, F(G,σ)F(G,\sigma) denotes its frustration index, and the girth is the length of its shortest cycle. Girth-five frustration index conjecture. If (G,σ)(G,\sigma) has girth at least 55, then

F(G,σ)≤310v(G).F(G,\sigma)\leq \frac{3}{10}v(G).

This proposes an improved upper bound for the frustration index when short cycles are forbidden; its status is open in the supplied source.

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.