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

25 papers

math.CO2026

On $2$ -factors of Hamiltonian graphs

Alberto Espuny Díaz, António Girão, Bertille Granet +1

Let $k \geq 2$ . We show that, for a sufficiently small $ε > 0$ , any sufficiently large $n$ -vertex Hamiltonian graph of minimum degree at least $n^{1 - ε}$ contains a…

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…

math.CO2024

Seymour's second neighbourhood conjecture: random graphs and reductions

Alberto Espuny Díaz, António Girão, Bertille Granet +1

A longstanding conjecture of Seymour states that in every oriented graph there is a vertex whose second outneighbourhood is at least as large as its outneighbourhood. In this short…

math.CO2024

Reconstruction of shredded random matrices

Paul Balister, Gal Kronenberg, Alex Scott +1

A matrix is given in ``shredded'' form if we are presented with the multiset of rows and the multiset of columns, but not told which row is which or which column is which. The matr…

math.CO2023★ 1 cited

$H$ -percolation with a random $H$

Zsolt Bartha, Brett Kolesnik, Gal Kronenberg

In $H$ -percolation, we start with an Erdős--Rényi graph $G_{n, p}$ and then iteratively add edges that complete copies of $H$ . The process percolates if all edges missing…