166 citations · 655 across the 82 of their papers we have counts for
Showing 2019 · math.COShow all
2 papers · 2 filters
math.CO2019
Linear programming bounds for cliques in Paley graphs
Mark Magsino, Dustin G. Mixon, Hans Parshall
The Lovász theta number is a semidefinite programming bound on the clique number of (the complement of) a given graph. Given a vertex-transitive graph, every vertex belongs to a ma…
math.CO2019
Doubly transitive lines II: Almost simple symmetries
Joseph W. Iverson, Dustin G. Mixon
We study lines through the origin of finite-dimensional complex vector spaces that enjoy a doubly transitive automorphism group. This paper classifies those lines that exhibit almo…