ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CmC_m be a cycle of even length m≥6m\ge6, let PnP_n be a path of odd order n≥5n\ge5, and let Cm⋈PnC_m\bowtie P_n denote their bow-tie graph. 3-extendability conjecture. For any even integer m≥6m\ge6 and any odd integer n≥5n\ge5, the graph Cm⋈PnC_m\bowtie P_n is 33-extendable. This would provide an infinite family of 33-extendable graphs with the stated bow-tie construction, extending the proved case involving C6⋈PnC_6\bowtie P_n; the conjecture remains open in the source.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.