Back to search

University of Birmingham

Embedding spanning structures in graphs and hypergraphs

Abstract

dc:description.abstract

In this thesis we prove three main results on embeddings of spanning subgraphs into graphs and hypergraphs. The first is that for log50 n/n \ ≤ p ≤ 1 – n -1/4 log9 n, a binomial random graph G ~ Gn,p contains with high probability a collection of └δ(G)/2┘ edge disjoint Hamilton cycles (plus an additional edge-disjoint matching if δ(G) is odd), which confirms for this range of p a conjecture of Frieze and Krivelevich. Secondly, we show that any `robustly expanding' graph with linear minimum degree on sufficiently many vertices contains every bipartite graph on the same number of vertices with bounded maximum degree and sublinear bandwidth. As corollaries we obtain the same result for any graph which satisfies the Ore-type condition d(x) + d(y) ≥ (1 + \(\eta\))n for non-adjacent vertices x and y, or which satisfies a certain degree sequence condition. Thirdly, for γ > 0 we give a polynomial-time algorithm for determining whether or not a k-graph with minimum codegree at least (1/k + γ)n contains a perfect matching. This essentially answers a question of Rodl, Rucinski and Szemeredi. Our algorithm relies on a strengthening of a structural result of Keevash and Mycroft. Finally and additionally, we include a short note on Maker-Breaker games.

Degree

thesis:*
Name dc:type.qualificationname
d_ph
Level dc:type.qualificationlevel
d_ph
Grantor dc:publisher.institution
University of Birmingham
Year dc:date.issued
2013

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Knox, Fiachra

Subjects

dc:subject × 1

Rights

Language dc:language.dcterms_iso639_2
eng

Chain of custody

source
Harvested from
University of Birmingham
Base URL
etheses.bham.ac.uk/cgi/oai2
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Knox, Fiachra. Embedding spanning structures in graphs and hypergraphs. d_ph thesis, University of Birmingham, 2013.