ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let tt be a positive integer. A 22-regular graph is a graph in which every vertex has degree 22; such a graph is a disjoint union of cycles.

Reed–Wood conjecture. Every graph with average degree at least

43t−2\tfrac{4}{3}t-2

contains every 22-regular tt-vertex graph as a minor.

This conjecture extends the paper's theorem for kk 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 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.