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 2025Show all

2 papers · 1 filter

math.CO2025

$(Δ - 1)$ -dicolouring of digraphs

Ararat Harutyunyan, Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta +1

In 1977, Borodin and Kostochka conjectured that every graph with maximum degree $Δ \geq 9$ is $(Δ - 1)$ -colourable, unless it contains a clique of size $Δ$ . In 1999, Reed confirmed th…

math.CO2025★ 1 cited

On rigid regular graphs and a problem of Babai and Pultr

Kolja Knauer, Gil Puig i Surroca

A graph is \textit{rigid} if it only admits the identity endomorphism. We show that for every $d \geq 3$ there exist infinitely many mutually rigid $d$ -regular graphs of arbitrary od…

(Δ−1)-dicolouring of digraphs

On rigid regular graphs and a problem of Babai and Pultr

$(Δ - 1)$ -dicolouring of digraphs