Show simple item record

Files in this item

Item metadata

dc.contributor.authorHuczynska, Sophie
dc.contributor.authorRuskuc, Nik
dc.contributor.editorCzumaj et al., A
dc.date.accessioned2016-01-05T10:12:06Z
dc.date.available2016-01-05T10:12:06Z
dc.date.issued2015-07
dc.identifier.citationHuczynska , 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-10 July . DOI: 10.1017/CBO9781316106853.009en
dc.identifier.citationconferenceen
dc.identifier.isbn9781107462502
dc.identifier.isbn9781316106853
dc.identifier.issn0076-0552
dc.identifier.otherPURE: 224611861
dc.identifier.otherPURE UUID: 8d661ec3-2fc1-4a07-be31-8be4fd190624
dc.identifier.otherScopus: 84954191695
dc.identifier.urihttp://hdl.handle.net/10023/7963
dc.description.abstractThe 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.en
dc.language.isoeng
dc.publisherCambridge University Press
dc.relation.ispartofSurveys in Combinatorics 2015en
dc.relation.ispartofseriesLondon Mathematical Society Lecture Note Seriesen
dc.rights© 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.009en
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectQA Mathematicsen
dc.subjectT-NDASen
dc.subject.lccQA75en
dc.subject.lccQAen
dc.titleWell quasi-order in combinatorics : embeddings and homomorphismsen
dc.typeConference itemen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.contributor.institutionUniversity of St Andrews. School of Mathematics and Statisticsen
dc.identifier.doihttp://dx.doi.org/10.1017/CBO9781316106853.009
dc.date.embargoedUntil01-01-20


The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record