7 citations · 14 across the 15 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023★ 1 cited
Rigid partitions: from high connectivity to random graphs
Michael Krivelevich, Alan Lew, Peleg Michaeli
A graph is called -rigid if there exists a generic embedding of its vertex set into such that every continuous motion of the vertices that preserves the lengths o…
math.CO2023
Discrepancies of subtrees
Tarun Krishna, Peleg Michaeli, Michail Sarantis +2
We study multicolour, oriented and high-dimensional discrepancies of the set of all subtrees of a tree. As our main result, we show that the -colour discrepancy of the subtrees…