scientific article; zbMATH DE number 3232673
From MaRDI portal
Publication:5520569
zbMATH Open0144.23305MaRDI QIDQ5520569FDOQ5520569
Authors: C. St. J. A. Nash-Williams
Publication date: 1965
Title of this publication is not available (Why is that?)
Cited In (66)
- On the logical strength of the better quasi order with three elements
- Hereditary classes of ordered sets of width at most two
- Algorithmic applications of tree-cut width
- Embeddability on functions: Order and chaos
- On self‐immersions of infinite graphs
- Ubiquity of locally finite graphs with extensive tree-decompositions
- The logical strength of minimal bad arrays
- The reverse mathematics of wqos and bqos
- Über eine Eigenschaft lokalfiniter, unendlicher Bäume. (On a property of locally finite infinite trees)
- The theory of well-quasi-ordering: a frequently discovered concept
- Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
- A canonical partition theorem for uniform families of finite strong subtrees
- The micro-world of cographs
- On the immersion relation and an embedding problem for infinite graphs
- On immersions of uncountable graphs
- Ordered sets with no chains of ideals of a given type
- Topological ubiquity of trees
- On well-quasi-ordering-finite graphs by immersion
- Foundations of BQO Theory
- Better quasi-orders for uncountable cardinals
- On a problem of R. Halin concerning infinite graphs
- There are exactly \(\omega_1\) topological types of locally finite trees with countably many rays
- On power varieties of semigroups
- The tree alternative conjecture under the topological minor relation
- Better-quasi-orderings and coinduction
- The uniform Martin's conjecture for many-one degrees
- Well-quasi-ordering and the Hausdorff quasi-uniformity
- A finite model theorem for the propositional \(\mu\)-calculus
- There are uncountably many topological types of locally finite trees
- Splitter theorems for 4-regular graphs
- Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
- Decomposing Aronszajn lines
- On Halin-lattices in graphs
- Labelled well-quasi-order for permutation classes
- Well-quasi-order of relabel functions
- Sur les premeilleurs ordres. (On prémeilleurs orderings)
- Termination of rewriting
- Recent progress on well-quasi-ordering graphs
- Epimorphisms between linear orders.
- Critical properties and complexity measures of read-once Boolean functions
- Continuous Fraïssé conjecture
- On isometry and isometric embeddability between ultrametric Polish spaces
- The Wadge hierarchy on Zariski topologies
- Constructing graphs with no immersion of large complete graphs
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Absolutely indecomposable modules
- Clique immersion in graphs without a fixed bipartite graph
- Scattered subsets of \(\mathbb{Q}\)
- On the structure of the Wadge degrees of bqo-valued Borel functions
- An estimate on the norm of the product of infinite block operator matrices
- Conditional geometric scales of discriminator varieties
- The FEP for some varieties of fully distributive knotted residuated lattices
- Well-Quasi Orders and Hierarchy Theory
- Laver and set theory
- Obituary: Ernest Corominas
- On better quasi-ordering countable trees
- A family of \(\omega_1\) topological types of locally finite trees
- Countable skeletons of finitely generated discriminator varieties
- Complete analytic equivalence relations
- The structure and definability in the lattice of equational theories of strongly permutative semigroups
- Well-partial orderings and their maximal order types
- Some quasi-ordered classes of finite commutative semigroups
- From wqo to bqo, via Ellentuck's theorem
- Jónsson posets
- A proof of the tree alternative conjecture under the topological minor relation
- Some theorems for scattered ordered sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5520569)