- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 11 to 20 of 152 (0.028 seconds)| 11 |
Topics in finite graph Ramsey theoryBorgersen, Robert David 18 January 2008 (has links)
For a positive integer $r$ and graphs $F$, $G$, and $H$, the graph Ramsey arrow notation $F \longrightarrow (G)^H_r$ means that for every $r$-colouring of the subgraphs of $F$ isomorphic to $H$, there exists a subgraph $G'$ of $F$ isomorphic to $G$ such that all the subgraphs of $G'$ isomorphic to $H$ are coloured the same. Graph Ramsey theory is the study of the graph Ramsey arrow and related arrow notations for other kinds of ``graphs" (\emph{e.g.}, ordered graphs, or hypergraphs). This thesis surveys finite graph Ramsey theory, that is, when all structures are finite.
One aspect surveyed here is determining for which $G$, $H$, and $r$, there exists an $F$ such that $F \longrightarrow (G)^H_r$. The existence of such an $F$ is guaranteed when $H$ is complete, whether ``subgraph" means weak or induced, and existence results are also surveyed when $H$ is non-complete. When such an $F$ exists, other aspects are surveyed, such as determining the order of the smallest such $F$, finding such an $F$ in some restricted family of graphs, and describing the set of minimal such $F$'s.
|
| 12 |
Topics in finite graph Ramsey theoryBorgersen, Robert David 18 January 2008 (has links)
For a positive integer $r$ and graphs $F$, $G$, and $H$, the graph Ramsey arrow notation $F \longrightarrow (G)^H_r$ means that for every $r$-colouring of the subgraphs of $F$ isomorphic to $H$, there exists a subgraph $G'$ of $F$ isomorphic to $G$ such that all the subgraphs of $G'$ isomorphic to $H$ are coloured the same. Graph Ramsey theory is the study of the graph Ramsey arrow and related arrow notations for other kinds of ``graphs" (\emph{e.g.}, ordered graphs, or hypergraphs). This thesis surveys finite graph Ramsey theory, that is, when all structures are finite.
One aspect surveyed here is determining for which $G$, $H$, and $r$, there exists an $F$ such that $F \longrightarrow (G)^H_r$. The existence of such an $F$ is guaranteed when $H$ is complete, whether ``subgraph" means weak or induced, and existence results are also surveyed when $H$ is non-complete. When such an $F$ exists, other aspects are surveyed, such as determining the order of the smallest such $F$, finding such an $F$ in some restricted family of graphs, and describing the set of minimal such $F$'s.
|
| 13 |
Ramsey functions for spaces with symmetriesKyriazis, Eleftherios 18 September 2012 (has links)
In this dissertation we study the notion of symmetry on groups, topological spaces,
et cetera. The relationship between such structures with symmetries and Ramsey
Theory is re
ected by certain natural functions. We give a general picture of
asymptotic behaviour of these functions.
|
| 14 |
Ramsey Property of Posets and Related StructuresSokic, Miodrag 17 February 2011 (has links)
We study several classes of finite posets equipped with linear orderings. We examine these classes according to the Ramsey and the ordering property. As an application we give several new extremely amenable groups of automorphisms of countable structures and compute several new universal minimal flows for such groups. The technique that we develop is also useful for studying classes of structures related to posets, such as quasi-orderings.
|
| 15 |
Ramsey Property of Posets and Related StructuresSokic, Miodrag 17 February 2011 (has links)
We study several classes of finite posets equipped with linear orderings. We examine these classes according to the Ramsey and the ordering property. As an application we give several new extremely amenable groups of automorphisms of countable structures and compute several new universal minimal flows for such groups. The technique that we develop is also useful for studying classes of structures related to posets, such as quasi-orderings.
|
| 16 |
Small Ramsey numbersIshii, Minoru, 1945- January 1985 (has links)
No description available.
|
| 17 |
Sin, guilt, justice and war Paul Ramsey and Reinhold Niebuhr on the moral framework for just war thought /Carnahan, Kevin. January 2007 (has links)
Thesis (Ph.D. in Religious Studies)--S.M.U., 2007. / Title from PDF title page (viewed Mar. 18, 2008). Source: Dissertation Abstracts International, Volume: 68-03, Section: A, page: 1021. Adviser: Robin W. Lovin. Includes bibliographical references.
|
| 18 |
An extension of Ramsey's theorem to multipartite graphsCook, Brian. January 2007 (has links)
Thesis (M.S.)--Georgia State University, 2007. / Title from file title page. Guantao Chen, committee chair; Michael Stewart, Yi Zhao, committee members. Electronic text ( 50 p.) : digital, PDF file. Description based on contents viewed Nov. 5, 2007. Includes bibliographical references (p. 49).
|
| 19 |
Not quite good enough : a critical reading of Paul Ramsey's medical indications policy /Antommaria, Armand H. Matheny. January 2000 (has links)
Thesis (Ph. D.)--University of Chicago, Divinity School, December 2000. / Includes bibliographical references. Also available on the Internet.
|
| 20 |
Completeness and incompleteness /Schaefer, Marcus Georg January 1999 (has links)
Thesis (Ph. D.)--University of Chicago, Dept. of Computer Science, June 1999. / Includes bibliographical references. Also available on the Internet.
|
Page generated in 0.0348 seconds