The 3-extendability conjecture for bow-tie graphs
Statement
Let be a cycle of even length , let be a path of odd order , and let denote their bow-tie graph. 3-extendability conjecture. For any even integer and any odd integer , the graph is -extendable. This would provide an infinite family of -extendable graphs with the stated bow-tie construction, extending the proved case involving ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.