1 citations · 2 across the 4 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
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 $\…
math.CO2026
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…