Turning retractions of an algebra into an algebra.
On the path number of a digraph.
On traces of maximal clones.
On dual Ramsey theorems for relational structures
We discuss dual Ramsey statements for several classes of finite relational structures (such as finite linearly ordered graphs, finite linearly ordered metric spaces and finite posets with a linear extension) and conclude the paper with another rendering of the Nešetřil-Rödl Theorem for relational structures. Instead of embeddings which are crucial for ``direct'' Ramsey results, for each class of structures under consideration we propose a special class of quotient maps and prove a dual Ramsey theorem...
Completeness criteria and invariants for operation and transformation algebras.
Oligomorphic transformation monoids and homomorphism-homogeneous structures
A structure is called homomorphism-homogeneous if every homomorphism between finitely generated substructures of the structure extends to an endomorphism of the structure (P. J. Cameron and J. Nešetřil, 2006). In this paper we introduce oligomorphic transformation monoids in full analogy to oligomorphic permutation groups and use this notion to propose a solution to a problem, posed by Cameron and Nešetřil in 2006, to characterize endomorphism monoids of homomorphism-homogeneous relational structures...
Strong retracts of unary algebras
This paper introduces the notion of a strong retract of an algebra and then focuses on strong retracts of unary algebras. We characterize subuniverses of a unary algebra which are carriers of its strong retracts. This characterization enables us to describe the poset of strong retracts of a unary algebra under inclusion. Since this poset is not necessarily a lattice, we give a necessary and sufficient condition for the poset to be a lattice, as well as the full description of the poset.
Page 1