KIT | KIT-Bibliothek | Impressum | Datenschutz

Extremal and Ramsey Type Questions for Graphs and Ordered Graphs

Rollin, Jonathan

Abstract (englisch):

In this thesis we study graphs and ordered graphs from an extremal point of view. In the first part of the thesis we prove that there are ordered forests H and ordered graphs of arbitrarily large chromatic number not containing such H as an ordered subgraph. In the second part we study pairs of graphs that have the same set of Ramsey graphs. We support a negative answer to the question whether there are pairs of non-isomorphic connected graphs that have this property. Finally we initiate the study of minimal ordered Ramsey graphs. For large families of ordered graphs we determine whether their members have finitely or infinitely many minimal ordered Ramsey graphs.

Volltext §
DOI: 10.5445/IR/1000072510
Cover der Publikation
Zugehörige Institution(en) am KIT Institut für Algebra und Geometrie (IAG)
Publikationstyp Hochschulschrift
Publikationsjahr 2017
Sprache Englisch
Identifikator urn:nbn:de:swb:90-725102
KITopen-ID: 1000072510
Verlag Karlsruher Institut für Technologie (KIT)
Umfang X, 154 S.
Art der Arbeit Dissertation
Fakultät Fakultät für Mathematik (MATH)
Institut Institut für Algebra und Geometrie (IAG)
Prüfungsdatum 17.05.2017
Schlagwörter ordered graphs, Ramsey theory, Ramsey equivalence
Referent/Betreuer Axenovich, M.
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page