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 815 for “"Ramsey"”.
-
Ramsey Theory
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 Numbers
… gives new finite and asymptotic estimates of the Ramsey numbers using certain number-theoretical considerations; it also contains a brief historical survey on determination of Ramsey numbers and related number-theoretical problems.</p>
-
Irredundant Ramsey numbers
… of the vertices in S-{v}. The irredundant Ramsey Number s(m, n) is the least value of p such that for any p-vertex graph G, either G has an irredundant vertex subset of at least n vertices or its complement G has an irredundant vertex subset of at least m vertices. The existence of these …
-
On Ramsey and Gallai-Ramsey numbers of some classes of graphs
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any edge coloring of a sufficiently large complete graph. This result is commonly known as Ramsey's theorem. The role of Ramsey number is to quantify some specific problems related to Ramsey's theorem. …
-
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
-
Ramsey Yelvington: Texan Playwright
No abstract prepared.
-
The Ramsey multiplicity problem
… chaos is impossible'' is a core concept of Ramsey theory. Ramsey's Theorem formalizes this idea by showing that any sufficiently large graph, no matter how disordered, must inevitably contain a certain type of pattern. The Ramsey multiplicity problem extends this concept quantitatively: …
-
CO-irredundant Ramsey numbers
… of the vertices of S - {v}. The CO-irredundant Ramsey number t(l, m) is the least value of n such that any n-vertex graph G either has a CO-irredundant vertex subset of at least m vertices, or its complement G has a CO-irredundant vertex subset of at least l vertices. The existence of these …
-
Parametrizing topological Ramsey spaces
… that essentially all infinite-dimensional Ramsey-type theorems proven using topological Ramsey space theory can be parametrized by products of infinitely many perfect sets. This theorem has applications in several known spaces, showing that certain ultrafilters are preserved under both …
-
Two Ramsey-related Problems
… conjecture, which is wide open. We also study Ramsey numbers of even cycles and paths under Gallai colorings, where a Gallai coloring is a coloring of the edges of a complete graph without rainbow triangles, and a Gallai k-coloring is a Gallai coloring that uses at most k colors. Given an …
-
Θέματα εργοδικής θεωρίας Ramsey
… X. Our theory extends the classical topological Ramsey theory, and in addition includes as particular cases the corresponding theory for coideals on the set of natural numbers proved by Louveau, Mathias, Farah and Todorcevic, the Milliken-Taylor partition theorems for sequences of finite subsets …
-
A Survey of Ramsey Theory
… strangers. Suppose one had a larger gathering. Ramsey theory proves that certain smaller collection of mutual acquaintances or strangers must always exist. (For instance, at any gathering of nine people there must either be three mutual acquaintances or four mutual strangers.) More generally, …
-
Irredundant and Mixed Ramsey Numbers
The irredundant Ramsey number, s(m,n), is the smallest p such that in every two-coloring of the edges of K[subscript]p using colors red (R) and blue (B), either the blue subgraph contains an m-element irredundant set or the red subgraph contains an n-element irredundant set. The mixed irredundant …
-
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 …
-
An exploration in Ramsey theory
… several introductory results in the realm of Ramsey Theory, a subfield of Combinatorics and Graph Theory. The proofs in this thesis revolve around identifying substructure amidst chaos. After showing the existence of Ramsey numbers of two types, we exhibit how these two numbers are related. …
-
Ramsey classes and partial orders
… classes can be expanded with an order to become Ramsey classes with the ordering property. The motivation for finding such classes is the 2005 paper of Kechris, Pestov and Todorcevic, showing that these concepts are important in topological dynamics for calculating universal minimal flow of …
-
Συμβολές στην Ευκλείδεια Θεωρία Ramsey
… of this PhD dissertation thesis, is Euclidean Ramsey theory and more specifically the problem of characterization of Ramsey sets. A finite subset Χ of some Euclidean space Rn for some n ∈ N is Ramsey, if for every number of colors r ∈ N there exists a large enough dimension N ∈ N, such that, …
Page 1 of 41