For every odd n\ge 7, does every n-vertex graph with minimum degree at least \lceil n/2\rceil contain a spanning copy of the graph obtained from the square of an n-cycle by…
Statement
For every odd n\ge 7, does every n-vertex graph with minimum degree at least \lceil n/2\rceil contain a spanning copy of the graph obtained from the square of an n-cycle by deleting alternate peripheral edges until exactly three consecutive vertices have degree 4, with the other n-3 vertices having degree 3?
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.