Electronic Theses and Dissertations

Author

David Lewis

Date

2020

Date of Award

2020

Document Type

Dissertation

Degree Name

Doctor of Philosophy

Committee Chair

Béla Bollobás

Committee Member

Paul Balister

Committee Member

James Campbell

Committee Member

Ebenezer George

Abstract

This dissertation analyses several problems in extremal combinatorics.In Part I, we study the following problem proposed by Barrus, Ferrara, Vandenbussche, and Wenger. Given a graph H and an integer t, what is the minimum number of coloured edges in a t-edge-coloured graph G on n vertices such that G does not contain a rainbow copy of H, but adding a new edge to G in any colour creates a rainbow copy of H? We determine the growth rates of these numbers for almost all graphs H and all t e(H).In Part II, we study dimension theory for finite partial orders. In Chapter 1, we introduce and define the concepts we use in the succeeding chapters.In Chapter 2, we determine the dimension of the divisibility order on [n] up to a factor of (log log n).In Chapter 3, we answer a question of Kim, Martin, Masak, Shull, Smith, Uzzell, and Wang on the local bipartite covering numbers of difference graphs.In Chapter 4, we prove some bounds on the local dimension of any pair of layers of the Boolean lattice. In particular, we show that the local dimension of the first and middle layers is asymptotically n / log n.In Chapter 5, we introduce a new poset parameter called local t-dimension. We also discuss the fractional variants of this and other dimension-like parameters.All of Part I is joint work with Antnio Giro of the University of Cambridge and Kamil Popielarz of the University of Memphis.Chapter 2 of Part II is joint work with Victor Souza of IMPA (Instituto de Matemtica Pura e Aplicada, Rio de Janeiro).Chapter 3 of Part II is joint work with Antnio Giro.

Comments

Data is provided by the student.

Library Comment

Dissertation or thesis originally submitted to ProQuest

Share

COinS