Ivan Khalamendyk

Certified Countermodels in Profile and Incidence Fibres of Diamond-Induced Edge Partitions

Let $G=(V,E)$ be a finite loopless directed graph. Each directed two-step diamond identifies its two pairs of opposite edges, and the connected components of the resulting auxiliary graph on $E$ define a canonical partition $\Pi_{\mathrm{opp}}(G)$. We ask whether a finite relational certificate built from the blocks of...