Finiteness conjecture for non-decomposable critically frustrated signed graphs
Finiteness conjecture for non-decomposable critically frustrated signed graphs
Let be a signed graph. A signed graph is critically -frustrated when its frustration index is and decreases after the removal of any edge; it is non-decomposable when it is not an edge-disjoint union of critically frustrated signed graphs and is not obtained from another critically frustrated signed graph by subdivision. Let denote the family of irreducible non-decomposable critically -frustrated signed graphs.
Finiteness conjecture. For every positive integer , the set is finite.
The cases and are explicitly classified, but finiteness for general positive integers remains open. This conjecture is also stated informally in the introduction and formally later in the paper.
Sources & referencesView supporting material
Primary source
Chiara Cappello, Reza Naserasr, Eckhard Steffen and Zhouningxin Wang, “Critically 3-frustrated signed graphs”, arXiv:2304.10243 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.