S. Hoory

collaborators

4 papers

math.CO2026

A New Lower Bound on the Spectral Radius of Graphs with Prescribed Average Degree

Sonny Ben-Shimon, Idan Eisner, Shlomo Hoory

This work establishes an improved lower bound for the spectral radius of a graph given its average degree. The new bound follows from an exact solution of the fractional relaxation…

math.CO2026

Solvable and unsolvable instances of the equal sum partition problem

Shlomo Hoory, Dani Kotlar

We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n, k \in N$ such that $k ∣ \sum_{i = 1}^{n} i$ and a partition $p_{1} + \dots + p_{k} = n$ , when…

math.CO2026

Entropy and the growth rate of universal covering trees

Idan Eisner, Shlomo Hoory

This work studies the relation between two graph parameters, $I ¨ $ and $I^$ . For an undirected graph $G$ , $I ¨ (G)$ is the growth rate of its universal covering tree, while $I^ (G)$ is…

math.CO2025

On the Girth of Graph Lifts

Shlomo Hoory

The size of the smallest $k$ -regular graph of girth at least $g$ is denoted by the well-studied function $n (k, g)$ . We introduce an analogous function $n (H, g)$ , defined as the small…