Gal Kronenberg

activity

20142026

most citedWeak saturation numbers of complete bipartite graphs in the clique

16 citations · 33 across the 19 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

math.PR2025

Sharp Fuss-Catalan thresholds in graph bootstrap percolation

Zsolt Bartha, Brett Kolesnik, Gal Kronenberg +1

We study graph bootstrap percolation on the Erdős-Rényi random graph $G_{n, p}$ . For all $r \geq 5$ , we locate the sharp $K_{r}$ -percolation threshold $p_{c} \sim (γ n)^{- 1/ λ}$ …

math.CO2025

A note on improved bounds for hypergraph rainbow matching problems

Candida Bowtell, Andrea Freschi, Gal Kronenberg +1

A natural question, inspired by the famous Ryser-Brualdi-Stein Conjecture, is to determine the largest positive integer $g (r, n)$ such that every collection of $n$ matchings, each o…