Finiteness conjecture for the subclass of critically frustrated signed graphs
Finiteness conjecture for the subclass of critically frustrated signed graphs
Let be the family of irreducible non-decomposable critically -frustrated signed graphs. For each integer , define to consist of those elements of such that every critically -frustrated subgraph of is non-decomposable.
Finiteness conjecture. For every positive integer , the set is finite.
This is presented as a relaxation of the finiteness conjecture for ; its status is not resolved in the source.
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.