Well quasi-order in combinatorics : embeddings and homomorphisms
MetadataShow full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
The notion of well quasi-order (wqo) from the theory of ordered sets often arises naturally in contexts where one deals with infinite collections of structures which can somehow be compared, and it then represents a useful discriminator between ‘tame’ and ‘wild’ such classes. In this article we survey such situations within combinatorics, and attempt to identify promising directions for further research. We argue that these are intimately linked with a more systematic and detailed study of homomorphisms in combinatorics.
Huczynska , S & Ruskuc , N 2015 , Well quasi-order in combinatorics : embeddings and homomorphisms . in A Czumaj et al. (ed.) , Surveys in Combinatorics 2015 . London Mathematical Society Lecture Note Series , no. 424 , Cambridge University Press , Cambridge , pp. 261-293 , 25th British Combinatorial Conference , Conventry , United Kingdom , 6/07/15 . https://doi.org/10.1017/CBO9781316106853.009conference
Surveys in Combinatorics 2015
© 2015, Publisher / the Author(s). This work is made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at www.ebooks.cambridge.org / https://dx.doi.org/10.1017/CBO9781316106853.009
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.