See by year See by month Jump to month

Kunos Ádám: Słupecki digraphs

 Download as iCal file
Wednesday, 7. May 2025, 10:10 - 11:10
Call a relational structure Słupecki if its surjective polymorphisms are all essentially unary. 
In general, it is hard to decide if a digraph is Słupecki or not. 
Nevertheless, we show some results and some directions where further investigations might go.

Back

JEvents v3.1.8 Stable   Copyright © 2006-2013