summary:We investigate tournaments that are projective in the variety that they generate, and free algebras over partial tournaments in that variety. We prove that the variety determined by three-variable equations of tournaments is not locally finite. We also construct infinitely many finite, pairwise incomparable simple tournaments
International audienceA very nice result of Bárány and Lehel asserts that every finite subset X or c...
AbstractLet n be a positive integer. A tournament is called n-existentially closed (or n-e.c.) if fo...
AbstractThe aim of this paper is to prove that there is no finite basis for the equations satisfied ...
summary:We investigate tournaments that are projective in the variety that they generate, and free a...
summary:We investigate congruences in one-element extensions of algebras in the variety generated by...
Abstract. The aim of this paper is to prove that there is no finite basis for the equations satisfie...
AbstractThe paper deals with tournaments (i.e., with trichotomic relations) and their homomorphisms....
AbstractA tournament is simple if the corresponding relational system is simple in the algebraic sen...
AbstractA tournament is a complete graph with its edges directed, and colouring a tournament means p...
AbstractA tournament is acyclically indecomposable if no acyclic autonomous set of vertices has more...
summary:We present an algorithm for constructing the free algebra over a given finite partial algebr...
Paired comparison is the process of comparing objects two at a time. A tournament in Graph Theory is...
We survey results concerning various generalizations of tournaments. The reader will see that tourna...
21ppInternational audienceA tournament is acyclically indecomposable if no acyclic autonomous set of...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
International audienceA very nice result of Bárány and Lehel asserts that every finite subset X or c...
AbstractLet n be a positive integer. A tournament is called n-existentially closed (or n-e.c.) if fo...
AbstractThe aim of this paper is to prove that there is no finite basis for the equations satisfied ...
summary:We investigate tournaments that are projective in the variety that they generate, and free a...
summary:We investigate congruences in one-element extensions of algebras in the variety generated by...
Abstract. The aim of this paper is to prove that there is no finite basis for the equations satisfie...
AbstractThe paper deals with tournaments (i.e., with trichotomic relations) and their homomorphisms....
AbstractA tournament is simple if the corresponding relational system is simple in the algebraic sen...
AbstractA tournament is a complete graph with its edges directed, and colouring a tournament means p...
AbstractA tournament is acyclically indecomposable if no acyclic autonomous set of vertices has more...
summary:We present an algorithm for constructing the free algebra over a given finite partial algebr...
Paired comparison is the process of comparing objects two at a time. A tournament in Graph Theory is...
We survey results concerning various generalizations of tournaments. The reader will see that tourna...
21ppInternational audienceA tournament is acyclically indecomposable if no acyclic autonomous set of...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
International audienceA very nice result of Bárány and Lehel asserts that every finite subset X or c...
AbstractLet n be a positive integer. A tournament is called n-existentially closed (or n-e.c.) if fo...
AbstractThe aim of this paper is to prove that there is no finite basis for the equations satisfied ...
DOI
Add to ORKG