David Fabian

activity

20192026

B_{h}

sets and random sets of integers

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Graph bootstrap percolation -- a discovery of slowness

David Fabian, Patrick Morris, Tibor Szabó

Graph bootstrap percolation is a discrete-time process capturing the spread of a virus on the edges of $K_{n}$ . Given an initial set $G \subseteq K_{n}$ of infected edges, the transmiss…

math.CO2025

Slow graph bootstrap percolation III: Chain constructions

David Fabian, Patrick Morris, Tibor Szabó

For graphs $H$ , we study the extremal function $M_{H} (n)$ which is the maximum running time (until stabilisation) of an $H$ -bootstrap percolation process on $n$ vertices. Building on…

math.CO2019★ 1 cited

On strong infinite Sidon and $B_{h}$ sets and random sets of integers

David Fabian, Juanjo Rué, Christoph Spiegel

A set of integers $S \subset N$ is an $α$ -strong Sidon set if the pairwise sums of its elements are far apart by a certain measure depending on $α$ , more specifically if $…

Graph bootstrap percolation -- a discovery of slowness

Slow graph bootstrap percolation III: Chain constructions

On strong infinite Sidon and Bh​ sets and random sets of integers

On strong infinite Sidon and $B_{h}$ sets and random sets of integers