Extremal and Ramsey Problems on Graphs and the Integers

Identifier

4953

Author

Julian David Raja Sahasrabudhe

Date

2017

Document Type

Dissertation

Degree Name

Doctor of Philosophy

Major

Mathematical Sciences

Concentration

Mathematics

Committee Member

Bela Bollobas

Committee Member

Paul Balister

Committee Member

Mate Wierdl

Abstract

The foundational belief that guides the work in this dissertation is that the pursuit of questions that are the most "basic" or "simply put" will ultimately lead to the greatest impact and application within and beyond mathematics. The reader shall see that we study only the most basic objects (finite sets of integers, finite sets of unordered pairs, colourings of the integers) and that the questions we consider assume very little about the underlying system that we study; we often assume only that our systems are "large", "dense" or do not contain a given substructure.

Comments

Data is provided by the student.

Library Comment

Dissertation or thesis originally submitted to the local University of Memphis Electronic Theses & dissertation (ETD) Repository.

Recommended Citation

Sahasrabudhe, Julian David Raja, "Extremal and Ramsey Problems on Graphs and the Integers" (2017). Electronic Theses and Dissertations. 1654.
https://digitalcommons.memphis.edu/etd/1654