Safe edge deletion, modular unichord certificates, and the 3-core
Statement
Conjecture 2 (Conforti, Rao) In every balanced graph, there exists an edge that can be deleted, so that the resulting graph remains balanced. Contributed by Gerard Cornuej` ols
K.1 Balanced circulants
Given interer k ≥ 1 and m ≥ 1, let us introduce a graph G(k, m ) = ( V, E ) with circular symmetry as follows: V = Zn = {0, 1,..., n − 1}, where n = 4 km, and ( i, j ) ∈ E iff
i − j + 4 mt = +1 or − 1 ( mod n )for some integer t. E.g. if k = 5, m = 2 then n = 40 and ( i, j ) ∈ E iff i − j(mod 40) ∈{7, 9; 15, 17; 23, 25; 31, 33; 39, 1}.
It is not difficult to check that G(k, m ) is balanced, i.e. it has no odd cycles, nor (4 i + 2)-holes. In fact, it may only contain holes of length 4 and 4 m. Moreover, every (4 i + 2)-cycle has at least two chords. Hence, G(k, m ) − e is still balanced for any edge e, in agreement with
Record
- Source
- Added
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.