Well quasi-order in combinatorics: embeddings and homomorphisms

Sophie Huczynska; Nik Ruskuc

doi:10.1017/CBO9781316106853.009

Well quasi-order in combinatorics: embeddings and homomorphisms

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 language	English
Title of host publication	Surveys in Combinatorics 2015
Editors	A Czumaj et al.
Place of Publication	Cambridge
Publisher	Cambridge University Press
Pages	261-293
ISBN (Electronic)	9781316106853
ISBN (Print)	9781107462502
DOIs	https://doi.org/10.1017/CBO9781316106853.009
Publication status	Published - Jul 2015
Event	25th British Combinatorial Conference - University of Warwick, Conventry, United Kingdom Duration: 6 Jul 2015 → 10 Jul 2015 http://www2.warwick.ac.uk/fac/sci/maths/research/events/2014-15/nonsymposium/25bcc/

Publication series

Name	London Mathematical Society Lecture Note Series
Number	424
ISSN (Print)	0076-0552

Conference

Conference	25th British Combinatorial Conference
Country/Territory	United Kingdom
City	Conventry
Period	6/07/15 → 10/07/15
Internet address	http://www2.warwick.ac.uk/fac/sci/maths/research/events/2014-15/nonsymposium/25bcc/

Access to Document

10.1017/CBO9781316106853.009

BCCpaperv9
© 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
Accepted author manuscript, 254 KB

The Structure of Permutation Classes: The Structure of Permutation Classes
Ruskuc, N. (PI)
EPSRC
21/10/11 → 20/10/14
Project: Standard

Cite this

@inproceedings{8d661ec32fc14a07be318be4fd190624,

title = "Well quasi-order in combinatorics: embeddings and homomorphisms",

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 {\textquoteleft}tame{\textquoteright} and {\textquoteleft}wild{\textquoteright} 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.",

author = "Sophie Huczynska and Nik Ruskuc",

year = "2015",

month = jul,

doi = "10.1017/CBO9781316106853.009",

language = "English",

isbn = "9781107462502",

series = "London Mathematical Society Lecture Note Series",

publisher = "Cambridge University Press",

number = "424",

pages = "261--293",

editor = "{Czumaj et al.}, A",

booktitle = "Surveys in Combinatorics 2015",

address = "United Kingdom",

note = "25th British Combinatorial Conference ; Conference date: 06-07-2015 Through 10-07-2015",

url = "http://www2.warwick.ac.uk/fac/sci/maths/research/events/2014-15/nonsymposium/25bcc/",

}

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.009

TY - GEN

T1 - Well quasi-order in combinatorics

T2 - 25th British Combinatorial Conference

AU - Huczynska, Sophie

AU - Ruskuc, Nik

PY - 2015/7

Y1 - 2015/7

N2 - 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.

AB - 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.

U2 - 10.1017/CBO9781316106853.009

DO - 10.1017/CBO9781316106853.009

M3 - Conference contribution

SN - 9781107462502

T3 - London Mathematical Society Lecture Note Series

SP - 261

EP - 293

BT - Surveys in Combinatorics 2015

A2 - Czumaj et al., A

PB - Cambridge University Press

CY - Cambridge

Y2 - 6 July 2015 through 10 July 2015

ER -

Well quasi-order in combinatorics: embeddings and homomorphisms

Abstract

Publication series

Conference

Access to Document

Fingerprint

Projects

The Structure of Permutation Classes: The Structure of Permutation Classes

Cite this