For a given set M of positive integers, a well-known problem of Motzkin asked to determine the maximal asymptotic density of M-sets, denoted by μ(M), where an M-set is a set of non-negative integers ...

An algebraic distance graph is defined to be a graph with vertices in E n in which two vertices are adjacent if and only if the distance between them is an algebraic number. It is proved that an ...

A new technique breaks Dijkstra's 70-year-old record: it finds routes faster in huge networks, changing graph theory forever.

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...

Graph theory isn’t enough. The mathematical language for talking about connections, which usually depends on networks — vertices (dots) and edges (lines connecting them) — has been an invaluable way ...

Now that pandemic restrictions are easing up, people are getting together again. But it’s been a while, so if you and your friends need some help breaking the ice, here’s a mathematical party game you ...