Turan problems in extremal graph theory and flexibility

Thumbnail Image
Date
2021-01-01
Authors
Murphy, Kyle
Major Professor
Advisor
Bernard Lidicky
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Altmetrics
Authors
Research Projects
Organizational Units
Organizational Unit
Journal Issue
Is Version Of
Versions
Series
Department
Mathematics
Abstract

In this work we will study two distinct areas of graph theory: generalized Turan problems and graph flexibility. In the first chapter, we will provide some basic definitions and motivation. Chapters 2 and 3 contain two submitted papers showing that two graphs, the cycle on five vertices and the path on four vertices, are maximized by the Turan graph when forbidding sufficiently large cliques. In chapter 4, we present new results on graph flexibility and weak flexibility for planar graphs.

Comments
Description
Keywords
Citation
Source
Copyright
Sat May 01 00:00:00 UTC 2021