AbstractIn this paper, we introduce a measure of the extent to which a finite combinatorial structure is a Ramsey object in the class of objects with a similar structure. We show for classes of finite relational structures, including graphs, binary posets, and bipartite graphs, how this measure depends on the symmetries of the structure
AbstractWe prove a generalization of Prömel's theorem to finite structures with both relations and f...
We study several classes of finite posets equipped with linear orderings. We examine these classes a...
We investigate two combinatorial properties of classes of finite structures, as well as related appl...
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...
summary:We discuss dual Ramsey statements for several classes of finite relational structures (such ...
summary:We discuss dual Ramsey statements for several classes of finite relational structures (such ...
We introduce two Ramsey classes of finite relational structures. The first class contains finite str...
We introduce two Ramsey classes of finite relational structures. The first class contains finite str...
Abstract. One way of studying a relational structure is to investigate functions which are related t...
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as ...
Let K be a class of finite relational structures. We define EK to be the class of finite relational ...
AbstractIn this paper we study dualities of graphs and, more generally, relational structures with r...
AbstractIn this paper we show the extent to which a finite tree of fixed height is a Ramsey object i...
We study several classes of finite posets equipped with linear orderings. We examine these classes a...
AbstractWe prove a generalization of Prömel's theorem to finite structures with both relations and f...
We study several classes of finite posets equipped with linear orderings. We examine these classes a...
We investigate two combinatorial properties of classes of finite structures, as well as related appl...
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...
summary:We discuss dual Ramsey statements for several classes of finite relational structures (such ...
summary:We discuss dual Ramsey statements for several classes of finite relational structures (such ...
We introduce two Ramsey classes of finite relational structures. The first class contains finite str...
We introduce two Ramsey classes of finite relational structures. The first class contains finite str...
Abstract. One way of studying a relational structure is to investigate functions which are related t...
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as ...
Let K be a class of finite relational structures. We define EK to be the class of finite relational ...
AbstractIn this paper we study dualities of graphs and, more generally, relational structures with r...
AbstractIn this paper we show the extent to which a finite tree of fixed height is a Ramsey object i...
We study several classes of finite posets equipped with linear orderings. We examine these classes a...
AbstractWe prove a generalization of Prömel's theorem to finite structures with both relations and f...
We study several classes of finite posets equipped with linear orderings. We examine these classes a...
We investigate two combinatorial properties of classes of finite structures, as well as related appl...
DOI
Add to ORKG