12 citations · 15 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2025
Tight bounds for expected propagation time of probabilistic zero forcing
Mehdi Jelassi, Julien Portier, Rik Sarkar
We study the probabilistic zero forcing process, a probabilistic variant of the classical zero forcing process. We show that for every connected graph on vertices, there ex…
math.CO2025
On problems in extremal multigraph theory
Victor Falgas-Ravry, Adva Mond, Rik Sarkar +1
A multigraph G is said to be an (s,q)-graph if every s-set of vertices in G supports at most q edges (counting multiplicities). In this paper we consider the maximal sum and produc…