Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 200 for “"Ramsey"”.
-
Ramsey Algebras and Ramsey Spaces
… theorem using idempotent ultrafilters. We study Ramsey algebras, which are structures that satisfy an analogue of Hindman's theorem. We show the existence of idempotent ultrafilters for Ramsey algebras under Martin's axiom, and the existence of idempotent ultrafilters for Ramsey algebras on a …
-
Ramsey Theory
<p>The Ramsey number $R(r, b)$ is the least positive integer such that every edge 2-coloring of the complete graph $K_{R(r, b)}$ with colors red and blue either embeds a red $K_r$ or a blue $K_b$. We explore various methods to find lower bounds on $R(r,b)$, finding new results on fibrations and …
-
Ramsey theory: The Erdős-Gyárfás problem and ordered size Ramsey questions
DSpace SAF Submission Ingestion Package generated from Vireo submission #16387 on 2021-09-16 at 16:42:26
-
An exploration in Ramsey theory
1 PDF file (viii, 39 pages)
-
Ramsey Theory Using Matroid Minors
This thesis considers a Ramsey Theory question for graphs and regular matroids. Specifically, how many elements N are required in a 3-connected graphic or regular matroid to force the existence of certain specified minors in that matroid? This question cannot be answered for an arbitrary collection …
-
Ramsey theory and its application
… this dissertation, we study three problems about Ramsey theory. First, we prove a self-dual Ramsey theorem for parameter systems which is a generalization of the self-dual Ramsey theorem developed by Solecki. Second, we prove a Ramsey theorem for finite sets equipped with a partial order and a …
-
Banach Spaces on Topological Ramsey Structures
… is constructed on the top of the topological Ramsey space <em>T<sub>1</sub></em> defined by Dobrinen and Todorcevic [6]. Finite approximations of the isomorphic subtrees are utilised in constructing the norm. The subspace on each “branch” of the tree is shown to resemble the structure of an …
-
Some problems in Graph Ramsey Theory
A graph G is r-Ramsey minimal with respect to a graph H if every r-coloring of the edges of G yields a monochromatic copy of H, but the same is not true for any proper subgraph of G. The study of the properties of graphs that are Ramsey minimal with respect to some H and similar problems is known …
-
Política fiscal optima en economía de Ramsey
Esta tesis solo está en formato papel por lo que se debe consultar en la propia Biblioteca Di Tella. La consulta se hace solo bajo reserva escribiendo a serviciosbiblio@utdt.edu.
-
Unprovability and phase transitions in Ramsey theory
… It is a strengthened form of the finite Ramsey theorem which can not be proved, nor refuted in Peano Arithmetic. In this dissertation we investigate several other unprovable statements of Ramseyan nature and determine the threshold functions for the related phase transitions. Chapter 1 …
-
Some arithmetic Ramsey problems and inverse theorems
In this dissertation we study arithmetic Ramsey type problems and inverse problems, in various settings. This work consists of two parts. In Part I, we study arithmetic Ramsey type problems over abelian groups. This part consists of three chapters. In Chapter 2, using hypergraph containers, we …
-
An Introduction to Ramsey Theory on Graphs
… is written as a single source introduction to Ramsey Theory for advanced undergraduates and graduate students.
-
Ramsey regions and simplicial homology tables for graphs
Ramsey Theory is the investigation of edge-colored graphs which force a monochromatic subgraph. We devise a way of breaking certain Ramsey Theory problems into "smaller" pieces so that information about Ramsey Theory can be gained without solving the entire problem, (which is often difficult to …
-
Results in Ramsey theory and extremal graph theory
… relating to graphs. The first problem is in Ramsey theory, while the others are in extremal graph theory. In Chapter 2, which is joint work with Vojtěch Dvořák, we consider the Ramsey number $R(F_n)$ of the fan graph $F_n$, a graph consisting of $n$ triangles which all share a common vertex. …
-
Extremal problems in combinatorial geometry and Ramsey theory
… to specific problems in combinatorial geometry, Ramsey theory and graph theory. We first study extremal questions in geometric graph theory, that is, the existence of collections of edges with a specified crossing pattern in drawings of graphs in the plane with sufficiently many edges. Among …
-
Forbidden substructures: induced subgraphs, Ramsey games, and sparse hypergraphs
… conjecture. In Chapter 3, we study a Ramsey-type game in an online and random setting. The player must color edges of K_n in an order chosen uniformly at random, and loses when she has created a monochromatic triangle. We provide upper bounds on the threshold for the number of edges …
-
Embedding problems and Ramsey-Turán variations in extremal graph theory
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2018-08-01
-
On vertex degrees, graph decomposition, and circular chromatic Ramsey number
… problems about vertex degrees and a variant of Ramsey number of graphs, and also structural problems about graph decomposition. In a list (d_1,...,d_n) of positive integers, let r and s denote the largest and smallest entries. A list is gap-free if each integer between r and s is present. In …
Page 1 of 10