Z. Bartha

activity

20132025

most citedWeakly saturated random graphs

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

collaborators

Showing math.COShow all

2 papers · 1 filter

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…

math.CO2021

Sharp bound on the threshold metric dimension of trees

Zsolt Bartha, Júlia Komjáthy, Järvi Raes

The threshold- $k$ metric dimension ( $Tmd_{k}$ ) of a graph is the minimum number of sensors -- a subset of the vertex set -- needed to uniquely identify any vertex in the gra…

H-percolation with a random H

Sharp bound on the threshold metric dimension of trees

$H$ -percolation with a random $H$