The Library
Well-quasi-ordering of combinatorial structures
Tools
Atminas, Aistis (2015) Well-quasi-ordering of combinatorial structures. PhD thesis, University of Warwick.
|
PDF
WRAP_THESIS_Atminas_2015.pdf - Submitted Version - Requires a PDF viewer. Download (1402Kb) | Preview |
Official URL: http://webcat.warwick.ac.uk/record=b2754395~S1
Abstract
In this work we study the notion of well-quasi-ordering for various partial orders and its relation to some other notions, such as clique-width. In particular, we prove decidability of well-quasi-ordering for factorial languages, subquadratic properties of graphs and classes of graphs with finite distinguishing number. In addition, we reveal some new classes of graphs and permutations which are or are not well-quasi-ordered. We also prove that subquadratic properties or classes of graphs with finite distinguishing number that are well-quasi-ordered have bounded clique-width and we identify two new minimal classes of graphs of unbounded clique-width.
Item Type: | Thesis (PhD) | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||
Library of Congress Subject Headings (LCSH): | Combinatorial analysis | ||||
Official Date: | February 2015 | ||||
Dates: |
|
||||
Institution: | University of Warwick | ||||
Theses Department: | Mathematics Institute | ||||
Thesis Type: | PhD | ||||
Publication Status: | Unpublished | ||||
Supervisor(s)/Advisor: | Lozin, Vadim V. | ||||
Sponsors: | University of Warwick. Centre for Discrete Mathematics and its Applications (DIMAP) ; Engineering and Physical Sciences Research Council (EPSRC) (EP/D063191/1) | ||||
Extent: | ix, 147 leaves : illustrations | ||||
Language: | eng |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year