Complete-graph-cycle bridge-sum orbit-length conjecture
Statement
Let K(v_i){{% \mathchoice {\raisebox{-.1mm}{\includegraphics[height=2ex]{Bridge}}} {\raisebox{-.1mm}{\includegraphics[height=2ex]{Bridge}}} {\raisebox{-.6mm}{\includegraphics[height=2ex]{Bridge}}} {\raisebox{-.5mm}{\includegraphics[height=2ex]{Bridge}}} }} C(v_j) be a bridge sum of a complete graph on vertices and a cycle graph on vertices, and let be the winding-number parameter determined by the initial labeling . Complete-graph-cycle bridge-sum conjecture. The orbit length of toric promotion on K(v_i){{% \mathchoice {\raisebox{-.1mm}{\includegraphics[height=2ex]{Bridge}}} {\raisebox{-.1mm}{\includegraphics[height=2ex]{Bridge}}} {\raisebox{-.6mm}{\includegraphics[height=2ex]{Bridge}}} {\raisebox{-.5mm}{\includegraphics[height=2ex]{Bridge}}} }} C(v_j) is
The conjecture proposes a labeling-dependent formula for bridge sums with a cycle component, extending the paper's results for complete-graph bridge sums; it 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.