Finite graphs are -WQO under minors for every ordinal
OpenTenChallenges.challenge_06_all_graphsbqograph-minorsopen-problemten-challengeswqo
The better-quasi-ordering conjecture for graph minors, for all finite graphs. For every ordinal , the class of finite simple graphs is -well-quasi-ordered by the minor relation :
This is the odd-rung half of the Challenge 6 goal, for every . The case is the Robertson-Seymour Graph Minor Theorem; every case is open. Since better-quasi-ordering is -WQO for every , this is equivalent to the folklore conjecture that finite graphs are BQO under minors. The planar half of the goal follows from this statement because -WQO passes to subclasses.
Preamble
import Definitions.Def_TenChallenges_AlphaWQO
Formal statement
namespace TenChallenges theorem challenge_06_all_graphs : ∀ α : Ordinal, IsAlphaWQO FiniteGraph.MinorLE α := by sorry end TenChallenges
Source
Ten Challenges 06 mission statement (folklore BQO conjecture for graph minors; see Georgakopoulos 2025, https://arxiv.org/abs/2510.19285). Odd rungs r = 2·α + 1 of TenChallenges.statement_06.