Gil Puig i Surroca

activity

20222026

most citedOn rigid regular graphs and a problem of Babai and Pultr

1 citations · 1 across the 5 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

math.CO2026

On the list version of a conjecture of Erdős and Neumann-Lara

Ararat Harutyunyan, Lucas Picasarri-Arrieta, Gil Puig i Surroca

The dichromatic number of a digraph $D$ , denoted by $χ (D)$ , is the smallest number of colours required to colour the vertices of $D$ such that each colour class induces an acyc…

math.CO2026

Acyclic sets and colorings in digraphs under restrictions on degrees and cycle lengths

Ararat Harutyunyan, Colin McDiarmid, Gil Puig i Surroca

Given a digraph $D$ , we denote by $α (D)$ the maximum size of an acyclic set of $D$ (i.e. a set of vertices which induces a subdigraph with no directed cycles), and by $\vecχ(D)…