2 papers
math.CO2021
Generalized saturation problems for cliques, paths, and stars
Jamie Radcliffe, Adam Volk
A graph is -saturated if it does not contain any copy of , but the addition of any missing edge in creates at least one copy of . Inspired by work of Alon and Shik…
math.NT2018
On the genus of a quotient of a numerical semigroup
Ayomikun Adeniran, Steve Butler, Colin Defant +6
We find a relation between the genus of a quotient of a numerical semigroup and the genus of itself. We use this identity to compute the genus of a quotient of when …