Cycle, barbell, or theta structure conjecture for girth-achieving cycles
Cycle, barbell, or theta structure conjecture for girth-achieving cycles
Let be an arbitrary connected graph with finite girth, and let be the set of cycle subgraphs in that achieve its girth. For each , let be the path-induced subgraph of by , and set . Cycle–barbell–theta structure conjecture. There exists isomorphic to a cycle, barbell, or theta graph, and the girth is computed by the corresponding sequence of swaps around that graph. The paper states this as a desired result and supplies only partial structural discussion, leaving the assertion open.
Sources & referencesView supporting material
Primary source
Ryan Jeong, “On Structural Aspects of Friends-And-Strangers Graphs”, arXiv:2203.10337 (2022).
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.