2010eScholarship (California Digital Library)Requires access

Integral and Euclidean Ramsey theory

Eric Tressler

Open publisher page 0 citations

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

About this research paper

What this paper is about

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

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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

Key concepts: Ramsey theory, Complement (music), Ramsey's theorem, Mathematics, Euclidean geometry, Combinatorics, Graph theory, Discrete mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Integral and Euclidean Ramsey theory — Research Paper | ScholarLens