Santiago Guzmán-Pro

collaborators

4 papers

math.CO2025

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

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

In this paper, we characterize graphs with circular chromatic number less than 3 in terms of certain balancing labellings studied in the context of signed graphs. In fact, we const…

math.LO2025

On the Computational Power of Extensional ESO

Manuel Bodirsky, Santiago GuzmÃ¡n Pro

Extensional ESO is a fragment of existential second-order logic (ESO) that captures the following family of problems. Given a fixed ESO sentence $I^¨$ and an input structure $\mathb…

math.CO2024

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…

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…