Santiago Guzmán-Pro

activity

20232025

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2025

Circular Chromatic Numbers, Signability, Relation Algebras, and Network Satisfaction Problems

Manuel Bodirsky, Santiago Guzmán-Pro, Moritz Jahn +2

In this paper, we characterize finite graphs with circular chromatic number less than 3 in terms of the existence of certain signings ( $Z_{2}$ -labellings studied in the conte…

math.CO2024

The Generic Circular Triangle-Free Graph

Manuel Bodirsky, Santiago Guzmán-Pro

In this paper, we introduce the generic circular triangle-free graph $C_{3}$ and propose a finite axiomatization of its first order theory. In particular, our main results sh…

math.CO2023

Forbidden Tournaments and the Orientation Completion Problem

Manuel Bodirsky, Santiago Guzmán-Pro

For a fixed finite set of finite tournaments $F$ , the $F$ -free orientation problem asks whether a given finite undirected graph $G$ has an $F$ -free o…