Showing 2023Show all
4 papers · 1 filter
math.CO2023
On the Number of Shortest Paths in Graphs
Itai Benjamini, Elad Tzalik
It is proved that the number of shortest paths between two vertices of distance in a graph with degrees bounded by is at most . This improves upon th…
cs.DS2023
Color Fault-Tolerant Spanners
Asaf Petruschka, Shay Sapir, Elad Tzalik
We initiate the study of spanners in arbitrarily vertex- or edge-colored graphs (with no "legality" restrictions), that are resilient to failures of entire color classes. When a co…
math.CO2023
Topological expansion for posets and the homological -connectivity of random -complexes
Ran Tessler, Elad Tzalik
We study high dimensional expansion beyond simplicial complexes (posets) and focus on -complexes which are complexes whose basic building blocks are linear spaces. We show that…
math.CO2023
The number of tiles of
Itai Benjamini, Gady Kozma, Elad Tzalik
It is proved that the number of subsets of that tile is .