Kathapurkar, Amarja (2023). Spanning and induced subgraphs in graphs and digraphs. University of Birmingham. Ph.D.
|
Kathapurkar2023PhD.pdf
Text - Accepted Version Available under License All rights reserved. Download (1MB) | Preview |
Abstract
In this thesis, we make progress on three problems in extremal combinatorics, particularly in relation to finding large spanning subgraphs, and removing induced subgraphs.
First, we prove a generalisation of a result of Komlós, Sárközy and Szemerédi and show that for n sufficiently large, any n-vertex digraph with minimum semidegree at least n/2+o(n) contains a copy of every n-vertex oriented tree with underlying maximum degree at most O(n/logn).
For our second result, we prove that when k is an even integer and n is sufficiently large, if G is a k-partite graph with vertex classes V1,…,Vk each of size n and δ(G[Vi,Vi+1])≥(1+1/k)n/2, then G contains a transversal Ck-factor, that is, a Ck-factor in which each copy of Ck contains exactly one vertex from each vertex class. In the case when k is odd, we reduce the problem to proving that when G is close to a specific extremal structure, it contains a transversal Ck-factor. This resolves a conjecture of Fischer for even k.
Our third result falls into the theory of edit distances. Let Cth be the t-th power of a cycle of length h, that is, a cycle of length h with additional edges between vertices at distance at most t on the cycle. Let Forb(Cth) be the class of graphs with no induced copy of Cth. For p∈[0,1], what is the minimum proportion of edges which must be added to or removed from a graph of density p to eliminate all induced copies of Cth? The maximum of this quantity over all graphs of density p is measured by the edit distance function, edForb(Cth)(p), a function which provides a natural metric between graphs and hereditary properties. For our third result, we determine edForb(Cth)(p) for all p≥p0 in the case when (t+1)∣h, where p0=Θ(1/h2), thus improving on earlier work of Berikkyzy, Martin and Peck.
Type of Work: | Thesis (Doctorates > Ph.D.) | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
Award Type: | Doctorates > Ph.D. | |||||||||
Supervisor(s): |
|
|||||||||
Licence: | All rights reserved | |||||||||
College/Faculty: | Colleges (2008 onwards) > College of Engineering & Physical Sciences | |||||||||
School or Department: | School of Mathematics | |||||||||
Funders: | Engineering and Physical Sciences Research Council | |||||||||
Subjects: | Q Science > QA Mathematics | |||||||||
URI: | http://etheses.bham.ac.uk/id/eprint/13869 |
Actions
![]() |
Request a Correction |
![]() |
View Item |
Downloads
Downloads per month over past year
