3 papers
cs.DM2020
Intensive use of computing resources for dominations in grids and other combinatorial problems
Alexandre Talon
Our goal is to prove new results in graph theory and combinatorics thanks to the speed of computers, used with smart algorithms. We tackle four problems. The four-colour theorem st…
cs.DM2019
Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach
Silvère Gangloff, Alexandre Talon
In this text, we prove the existence of an asymptotic growth rate of the number of dominating sets (and variants) on finite rectangular grids, when the dimensions of the grid grow…
math.CO2016
Decomposing 8-regular graphs into paths of length 4
Fábio Botler, Alexandre Talon
A -decomposition of a graph is a set of edge-disjoint copies of in that cover the edge set of . Graham and Häggkvist (1989) conjectured that any -regular g…