S. Hoory

activity

20042026

most citedOn the girth of random Cayley graphs

31 citations · 47 across the 10 of their papers we have counts for

collaborators

10 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.CO2024

Entropy and the growth rate of universal covering trees

Idan Eisner, Shlomo Hoory

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

math.CO2024

An infinite family of counterexamples to a conjecture on distance magic labeling

Ehab Ebrahem, Shlomo Hoory, Dani Kotlar

This work is about a partition problem which is an instance of the distance magic graph labeling problem. Given positive integers $n, k$ and $p_{1} \leq p_{2} \leq \dots \leq p_{k}$ such that…

math.CO2024

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…

math.CO2007★ 9 cited

The Non-Backtracking Spectrum of the Universal Cover of a Graph

Omer Angel, Joel Friedman, Shlomo Hoory

A non-backtracking walk on a graph, $H$ , is a directed path of directed edges of $H$ such that no edge is the inverse of its preceding edge. Non-backtracking walks of a given lengt…