Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture

DOI10.1016/J.JCTB.2023.09.001MaRDI QIDQ6144398FDOQ6144398

Authors: Nathan Bowler, Yared Nigussie 

Publication date: 29 January 2024

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Recommendations

• Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
• Graph minors. IV: Tree-width and well-quasi-ordering
• scientific article; zbMATH DE number 1678363
• scientific article; zbMATH DE number 4033746
• On well-quasi-ordering infinite trees---Nash-Williams's theorem revisited

zbMATH Keywords

liftingwell-quasi-orderingtree idealsmagic-tree

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Graph theory
• Graph minors. XX: Wagner's conjecture
• Title not available (Why is that?)
• Partial well‐ordering of sets of vectors
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• Ordering by Divisibility in Abstract Algebras
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Graph minors. IV: Tree-width and well-quasi-ordering
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finite structure for Friedman ideals of finite trees

This page was built for publication: Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144398)