New constructions in Ramsey theory

Placeholder Show Content

Abstract/Contents

Abstract
Ramsey theory is the study of the patterns and structures that must arise in any sufficiently large system. Many important results in Ramsey theory rely on certain constructions of large systems with special properties, such as Erdős's random construction of a graph with no large clique or independent set. In this thesis, we use probabilistic and combinatorial tools to find new constructions, and thus make progress on multiple Ramsey-theoretic problems.

Description

Type of resource text
Form electronic resource; remote; computer; online resource
Extent 1 online resource.
Place California
Place [Stanford, California]
Publisher [Stanford University]
Copyright date 2022; ©2022
Publication date 2022; 2022
Issuance monographic
Language English

Creators/Contributors

Author Wigderson, Yuval
Degree supervisor Fox, Jacob, 1984-
Thesis advisor Fox, Jacob, 1984-
Thesis advisor Chatterjee, Sourav
Thesis advisor Vondrak, Ján, (Mathematician)
Degree committee member Chatterjee, Sourav
Degree committee member Vondrak, Ján, (Mathematician)
Associated with Stanford University, Department of Mathematics

Subjects

Genre Theses
Genre Text

Bibliographic information

Statement of responsibility Yuval Wigderson.
Note Submitted to the Department of Mathematics.
Thesis Thesis Ph.D. Stanford University 2022.
Location https://purl.stanford.edu/nh329df1698

Access conditions

Copyright
© 2022 by Yuval Wigderson
License
This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).

Also listed in

Loading usage metrics...