3 papers
math.CO2025
On the expressive power of -edge-colourings of graphs
Jan Bok, Santiago Guzmán-Pro, Nikola Jedličková +1
Given a finite set of -edge-coloured graphs and a hereditary property of graphs , we say that expresses if a graph has t…
math.CO2020
Duality pairs and homomorphisms to oriented and unoriented cycles
Santiago Guzmán-Pro, César Hernández-Cruz
In the homomorphism order of digraphs, a duality pair is an ordered pair of digraphs such that for any digraph, , if and only if . The directed path…
math.CO2020
Orientations without forbidden patterns on three vertices
Santiago Guzmán-Pro, César Hernández-Cruz
Given a set of oriented graphs, a graph is an -graph if it admits an -free orientation. Building on previous work by Bang-Jensen and Urrutia, we propose a master algo…