1 citations · 2 across the 4 of their papers we have counts for
5 papers
Complexity of finding color-avoiding connected components
Panna Tímea Fekete, Roland Molontay, Kitti Varga
Two vertices of a (not necessarily properly) arc-colored digraph are called arc--color-avoiding strongly -arc-connected if, after the removal of the arcs of any at most $\…
Logarithmic convergence of finite projective planes
Márton Borbényi, Panna Tímea Fekete, Aranka Hrušková +1
In this paper, we study the so-called log-convergence of graphs defined by Balázs Szegedy (arXiv:1504.00858). We answer his Question 4 affirmatively: the sequence of incidence grap…
Posets are easily testable
Panna Tímea Fekete, Gábor Kun
Alon and Shapira proved that every monotone class (closed under taking subgraphs) of undirected graphs is strongly testable, that is, under the promise that a given graph is either…
Color-avoiding percolation in edge-colored Erdős-Rényi graphs
Balázs Ráth, Kitti Varga, Panna Tímea Fekete +1
We study a variant of the color-avoiding percolation model introduced by Krause et al., namely we investigate the color-avoiding bond percolation setup on (not necessarily properly…
The cut norm and Sampling Lemmas for unbounded kernels
Panna Tímea Fekete, Dávid Kunszenti-Kovács
Generalizing the bounded kernel results of Borgs, Chayes, Lovász, Sós and Vesztergombi (2008), we prove two Sampling Lemmas for unbounded kernels with respect to the cut norm. On t…