University of Birmingham
Extremal results in hypergraph theory via the absorption method
Abstract
dc:description.abstractThe so-called "absorbing method" was first introduced in a systematic way by Rödl, Ruciński and Szemerédi in 2006, and has found many uses ever since. Speaking in a general sense, it is useful for finding spanning substructures of combinatorial structures. We establish various results of different natures, in both graph and hypergraph theory, most of them using the absorbing method: 1. We prove an asymptotically best-possible bound on the strong chromatic number with respect to the maximum degree of the graph. This establishes a weak version of a conjecture of Aharoni, Berger and Ziv. 2. We determine asymptotic minimum codegree thresholds which ensure the existence of tilings with tight cycles (of a given size) in uniform hypergraphs. Moreover, we prove results on coverings with tight cycles. 3. We show that every 2-coloured complete graph on the integers contains a monochromatic infinite path whose vertex set is sufficiently "dense" in the natural numbers. This improves results of Galvin and Erdős and of DeBiasio and McKenney.
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
-
- Sanhueza Matamala, Nicolás
Subjects
dc:subject × 1Rights
- Language dc:language.dcterms_iso639_2
- eng