3 papers
cs.DM2025
Making Graphs Irregular through Irregularising Walks
Julien Bensmail, Romain Bourneuf, Paul Colinot +2
The 1-2-3 Conjecture, introduced by KaroÅski, Åuczak, and Thomason in 2004, was recently solved by Keusch. This implies that, for any connected graph different from , we…
math.CO2025
Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
Romain Bourneuf, Jana MasaÅÃková, Wojciech Nadara +1
For a fixed integer , a (-)long claw, denoted , is the unique tree with three leaves, each at distance exactly from the vertex of degree three. Majewski…
cs.DM2024
Bounding -scatter dimension via metric sparsity
Romain Bourneuf, Marcin Pilipczuk
A recent work of Abbasi et al. [FOCS 2023] introduced the notion of -scatter dimension of a metric space and showed a general framework for efficient parameterized app…