4 papers
Maximizing subgraph counts in regular graphs
Gabor Lippner, Arturo Ortiz San Miguel
Given a graph , we investigate the -regular graphs with the highest -density. We reframe the problem as a continuous optimization problem on the eigenvalues of by…
Burning games on strong path products
Sally Ambrose, Evan Angelone, Jacob Chen +5
Burning and cooling are diffusion processes on graphs in which burned (or cooled) vertices spread to their neighbors with a new source picked at discrete time steps. In burning, th…
Cops and robbers on chess graphs
Sally Ambrose, Evan Angelone, Jacob Chen +5
Cops and robbers is a pursuit-evasion game played on graphs. We completely classify the cop numbers for knight graphs and queen graphs. This completes the classificati…
Non-universality in clustered ballistic annihilation
Matthew Junge, Arturo Ortiz San Miguel, Lily Reeves +1
In ballistic annihilation, infinitely many particles with randomly assigned velocities move across the real line and mutually annihilate upon contact. We introduce a variant with s…