On well-quasi-ordering finite structures with labels
type: Item
instance of: scholarly article
title: On well-quasi-ordering finite structures with labels
zbMATH Open document ID: 0699.06003
DOI: 10.1007/BF01787479
author: Igor Kriz
author: Robin Thomas
published in: Graphs and Combinatorics
publication date: 1990-01-01T00:00:00Z
review text: The authors proposes two conjectures relating various labelings Q(A) of concrete categories Q of finite sets and injections, and prove partial results about them. The drift of the conjectures is that any labeling Q(A) which is well-quasi-ordered can be replaced by labeling by ordinals up to the type c(A).
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 18B35
zbMATH DE Number: 4145962
zbMATH Keywords: labelings of concrete categories of finite sets and injections
zbMATH Keywords: well- quasi-ordered labelings
zbMATH Keywords: labeling by ordinals
reviewed by: J. R. Isbell
MaRDI profile type: Publication
cites work: Q3773882
cites work: Nonconstructive tools for proving polynomial-time decidability
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Q3874266
cites work: Q3972753
cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
cites work: The theory of well-quasi-ordering: a frequently discovered concept
cites work: Q5537629
cites work: Partial well‐ordering of sets of vectors
cites work: Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
full work available at URL: https://doi.org/10.1007/bf01787479
OpenAlex ID: W1972783806
description: scientific article; zbMATH DE number 4145962