Bounding the number of arithmetical structures on graphs

Christopher Keyes, Tomer Reiter

Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\text{r},\text{d})$ on $G$, we describe a cons…