The Reed–Wood conjecture on minors of 2-regular graphs
Statement
Let be a positive integer. A -regular graph is a graph in which every vertex has degree ; such a graph is a disjoint union of cycles.
Reed–Wood conjecture. Every graph with average degree at least
contains every -regular -vertex graph as a minor.
This conjecture extends the paper's theorem for disjoint cycles of the same order by allowing the cycles in the desired minor to have different orders. It was stated by Reed and Wood and remains open here.
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.