228 citations · 418 across the 12 of their papers we have counts for
4 papers · 1 filter
Invariant random matchings in Cayley graphs
Endre Csoka, Gabor Lippner
We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching.…
Core percolation on complex networks
Yang-Yu Liu, Endre Csóka, Haijun Zhou +1
As a fundamental structural transition in complex networks, core percolation is related to a wide range of important problems. Yet, previous theoretical studies of core percolation…
Positive graphs
Omar Antolín Camarena, Endre Csóka, Tamás Hubai +2
We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graph…
Variants of local algorithms on sparse graphs
Endre Csóka
Suppose we want to construct some structure on a bounded-degree graph, e.g., an almost maximum matching, and we want to decide about each edge depending only on its constant-radius…