scientific article
From MaRDI portal
Publication:3773882
zbMath0635.03060MaRDI QIDQ3773882
Neil Robertson, Harvey M. Friedman, P. D. Seymour
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
minimal bad sequenceimpredicative methodsminor inclusionfinite forms of the graph minor theoremFriedman's tree theoremwell-quasi- ordering
Partial orders, general (06A06) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Metamathematics of constructive systems (03F50)
Related Items (33)
A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH ⋮ On search, decision, and the efficiency of polynomial-time algorithms ⋮ Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ Graph Minors and Parameterized Algorithm Design ⋮ Quickly deciding minor-closed parameters in general graphs ⋮ Effective computation of immersion obstructions for unions of graph classes ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Fraïssé’s conjecture in Π11-comprehension ⋮ On the robustness of potential-based flow networks ⋮ The maximal linear extension theorem in second order arithmetic ⋮ Unprovability threshold for the planar graph minor theorem ⋮ On well-quasi-ordering finite structures with labels ⋮ Computability-theoretic and proof-theoretic aspects of partial and linear orderings ⋮ Confronting intractability via parameters ⋮ Upper Bounds on the Graph Minor Theorem ⋮ The Reverse Mathematics of wqos and bqos ⋮ Constructive complexity ⋮ The consistency of arithmetic ⋮ Programs from proofs using classical dependent choice ⋮ Long finite sequences ⋮ Two applications of analytic functors ⋮ Unnamed Item ⋮ Pure \(\Sigma_2\)-elementarity beyond the core ⋮ Exact unprovability results for compound well-quasi-ordered combinatorial classes ⋮ On Fraïssé's conjecture for linear orders of finite Hausdorff rank ⋮ From Kruskal’s theorem to Friedman’s gap condition ⋮ The strength of compactness in computability theory and nonstandard analysis ⋮ Algorithms and obstructions for linear-width and related search parameters ⋮ Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover ⋮ A Glimpse of $$ \sum_{3} $$-elementarity ⋮ Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor ⋮ The structure of the models of decidable monadic theories of graphs ⋮ Minimal acyclic forbidden minors for the family of graphs with bounded path-width
This page was built for publication:
