ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and let e∈E(G)e\in E(G) be an edge. Write G−eG-e for the graph obtained by deleting ee, and let Z(1)+(G)Z^+_{(1)}(G) denote the positive semidefinite 11-leaky forcing number of GG. Edge-deletion conjecture. For every graph GG and every edge e∈E(G)e\in E(G),

Z(1)+(G)−Z(1)+(G−e)≤1.Z^+_{(1)}(G)-Z^+_{(1)}(G-e)\leq 1.

The conjecture gives an upper bound complementary to the proved lower bound in Proposition cited in the surrounding discussion. It was computationally verified for all connected graphs through order eight, but the general case 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.