Integral and Euclidean Ramsey theory
Eric Tressler
Abstract
Eric Tressler
Abstract
Ramsey theory is the study of unavoidable structure within a system. This idea is very broad, and also useful in many applications, so the theory is vast. The original theorem of Ramsey [32] states that given k, there is n such that for any graph G on n vertices, either G or its complement contain K_k as a subgraph. Statements like this can be made about any mathematical structure, but this dissertation will focus on sets of integers and on Euclidean space, both of which support a large literature within Ramsey theory. Finally, we will consider a problem in extremal combinatorics, a field that has a large intersection with Ramsey theory
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Ramsey theory is the study of unavoidable structure within a system. This idea is very broad, and also useful in many applications, so the theory is vast. The original theorem of Ramsey [32] states that given k, there is n such that for any graph G on n vertices, either G or its complement contain K_k as a subgraph. Statements like this can be made about any mathematical structure, but this dissertation will focus on sets of integers and on Euclidean space, both of which support a large literature within Ramsey theory. Finally, we will consider a problem in extremal combinatorics, a field that has a large intersection with Ramsey theory
Key concepts: Ramsey theory, Complement (music), Ramsey's theorem, Mathematics, Euclidean geometry, Combinatorics, Graph theory, Discrete mathematics