Well quasi-order in combinatorics: embeddings and homomorphisms

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)
29 Downloads (Pure)

Abstract

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.
Original languageEnglish
Title of host publicationSurveys in Combinatorics 2015
EditorsA Czumaj et al.
Place of PublicationCambridge
PublisherCambridge University Press
Pages261-293
ISBN (Electronic)9781316106853
ISBN (Print)9781107462502
DOIs
Publication statusPublished - Jul 2015
Event25th British Combinatorial Conference - University of Warwick, Conventry, United Kingdom
Duration: 6 Jul 201510 Jul 2015
http://www2.warwick.ac.uk/fac/sci/maths/research/events/2014-15/nonsymposium/25bcc/

Publication series

NameLondon Mathematical Society Lecture Note Series
Number424
ISSN (Print)0076-0552

Conference

Conference25th British Combinatorial Conference
Country/TerritoryUnited Kingdom
CityConventry
Period6/07/1510/07/15
Internet address

Fingerprint

Dive into the research topics of 'Well quasi-order in combinatorics: embeddings and homomorphisms'. Together they form a unique fingerprint.

Cite this