7 citations · 11 across the 11 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020
On directed analogues of expander and hyperfinite graph sequences
Endre Csóka, Łukasz Grabowski
We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call "extender" and "hypershallow" graph sequences,…
math.CO2020
Upper bounds for the necklace folding problems
Endre Csóka, Zoltán L. Blázsik, Zoltán Király +1
A necklace can be considered as a cyclic list of red and blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs…