AbstractIn this paper we show the extent to which a finite tree of fixed height is a Ramsey object in the class of trees of the same height can be measured by its symmetry group
AbstractTwo configurations (i.e., finite planar point sets) are said to be of the same order type, i...
AbstractFor a positive integer n and graph B, fB(n) is the least integer m such that any graph of or...
The age of each countable homogeneous permutation forms a Ramsey class. Thus, there are five counta...
AbstractIn this paper, we introduce a measure of the extent to which a finite combinatorial structur...
AbstractIn this paper we introduce a measure of the extent to which a given finite poset deviates fr...
AbstractIn this paper, we introduce a measure of the extent to which a finite combinatorial structur...
AbstractIn this paper we introduce a measure of the extent to which a given finite poset deviates fr...
Abstract. We show that the class of finite rooted binary plane trees is a Ramsey class (with respect...
AbstractThe Ramsey Number r(G1, G2) is the least integer N such that for every graph G with N vertic...
AbstractWe prove a Ramsey theorem for trees. The infinite version of this theorem can be stated: if ...
AbstractIf S, T, and U are posets, let U → (S, T)2 mean that for any coloring ξ: U → {red, blue}, ei...
AbstractSufficient conditions are given in terms of δ(G) and Δ(T), for a graph G with n vertices to ...
Abstract. I will give a presentation of an abstract approach to finite Ramsey theory found in an ear...
The isometric Ramsey number IR( ~ H) of a family ~ H of digraphs is the smallest number of vertices ...
Let F be a set of relational trees and let Forbh(F) be the class of all structures that admit no ho...
AbstractTwo configurations (i.e., finite planar point sets) are said to be of the same order type, i...
AbstractFor a positive integer n and graph B, fB(n) is the least integer m such that any graph of or...
The age of each countable homogeneous permutation forms a Ramsey class. Thus, there are five counta...
AbstractIn this paper, we introduce a measure of the extent to which a finite combinatorial structur...
AbstractIn this paper we introduce a measure of the extent to which a given finite poset deviates fr...
AbstractIn this paper, we introduce a measure of the extent to which a finite combinatorial structur...
AbstractIn this paper we introduce a measure of the extent to which a given finite poset deviates fr...
Abstract. We show that the class of finite rooted binary plane trees is a Ramsey class (with respect...
AbstractThe Ramsey Number r(G1, G2) is the least integer N such that for every graph G with N vertic...
AbstractWe prove a Ramsey theorem for trees. The infinite version of this theorem can be stated: if ...
AbstractIf S, T, and U are posets, let U → (S, T)2 mean that for any coloring ξ: U → {red, blue}, ei...
AbstractSufficient conditions are given in terms of δ(G) and Δ(T), for a graph G with n vertices to ...
Abstract. I will give a presentation of an abstract approach to finite Ramsey theory found in an ear...
The isometric Ramsey number IR( ~ H) of a family ~ H of digraphs is the smallest number of vertices ...
Let F be a set of relational trees and let Forbh(F) be the class of all structures that admit no ho...
AbstractTwo configurations (i.e., finite planar point sets) are said to be of the same order type, i...
AbstractFor a positive integer n and graph B, fB(n) is the least integer m such that any graph of or...
The age of each countable homogeneous permutation forms a Ramsey class. Thus, there are five counta...
DOI
Add to ORKG