Back to search

University of Birmingham

Hamiltonicity problems in random graphs

Abstract

dc:description.abstract

In this thesis, we present some of the main results proved by the author while fulfilling his PhD. While we present all the relevant results in the introduction of the thesis, we have chosen to focus on two of the main ones. First, we show a very recent development about Hamiltonicity in random subgraphs of the hypercube, where we have resolved a long standing conjecture dating back to the 1980s. Second, we present some original results about correlations between the appearance of edges in random regular hypergraphs, which have many applications in the study of subgraphs of random regular hypergraphs. In particular, these applications include subgraph counts and property testing.

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
2020

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Espuny Díaz, Alberto
ORCID person:identifier.orcid

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

Espuny Díaz, Alberto. Hamiltonicity problems in random graphs. d_ph thesis, University of Birmingham, 2020.