Adam Gregory
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Adam Gregory has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Alejandra Brewer
Auburn University
1 shared publication - Brendan Rooney
Department of Mathematics Brigham Young University Provo UT
1 shared publication - Darren A. Narayan
School of Mathematics and Statistics, Rochester Institute of Technology, Rochester, NY 14623, USA
1 shared publication - Emma Farnsworth
University of Rochester
1 shared publication Herlandt Lino
Rochester Institute of Techology
1 shared publicationNatalie Gomez
Texas State University
1 shared publication
Latest Publications
- Open Access
- 28 October 2025
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 20 (2) , 508-523
The asymmetric index of a graph
A graph $G$ is asymmetric if its automorphism group is trivial. Asymmetric graphs were introduced by Erdős and Rényi (1963). They suggested the problem of starting with an asymmetric graph and removing some number $r$ of edges and/or adding some number $s$ of edges so that the resulting graph is nonasymmetric. Erdős and Rényi defined the degree of asymmetry of a graph to be the minimum value of $r+s$. In this paper, we define another property that measures how close a given nonasymmetric graph is to being asymmetric. We define the asymmetric index of a graph $G$, denoted $ai(G)$, to be the minimum of $r+s$ so that the resulting graph $G$ is asymmetric. We investigate the asymmetric index of both connected and disconnected graphs. We prove that for any nonnegative integer $k$, there exists a graph $G$ where $ai(G)=k$. We show that the asymmetric index of a cycle with at least six vertices is two, and provide a complete characterization of all possible pairs of edges that can be added to a cycle to create an asymmetric graph. In addition we determine the asymmetric index of paths, certain circulant graphs, Cartesian products involving paths and cycles, and bounds for complete graphs, and complete bipartite graphs.- 28 October 2025
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 20 (2) , 508-523
Open AccessThe asymmetric index of a graph
A graph $G$ is asymmetric if its automorphism group is trivial. Asymmetric graphs were introduced by Erdős and Rényi (1963). They suggested the problem of starting with an asymmetric graph and removing some number $r$ of edges and/or adding some number $s$ of edges so that the resulting graph is nonasymmetric. Erdős and Rényi defined the degree of asymmetry of a graph to be the minimum value of $r+s$. In this paper, we define another property that measures how close a given nonasymmetric graph is to being asymmetric. We define the asymmetric index of a graph $G$, denoted $ai(G)$, to be the minimum of $r+s$ so that the resulting graph $G$ is asymmetric. We investigate the asymmetric index of both connected and disconnected graphs. We prove that for any nonnegative integer $k$, there exists a graph $G$ where $ai(G)=k$. We show that the asymmetric index of a cycle with at least six vertices is two, and provide a complete characterization of all possible pairs of edges that can be added to a cycle to create an asymmetric graph. In addition we determine the asymmetric index of paths, certain circulant graphs, Cartesian products involving paths and cycles, and bounds for complete graphs, and complete bipartite graphs. - Open Access
- 13 January 2023
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 30 (1) , P1.24
Lenart's Bijection via Bumpless Pipe Dreams
Pipe dreams and bumpless pipe dreams for vexillary permutations are each known to be in bijection with certain semistandard tableaux via maps due to Lenart and Weigandt, respectively. Recently, Gao and Huang have defined a bijection between the former two sets. In this note we show for vexillary permutations that the Gao-Huang bijection preserves the associated tableaux, giving a new proof of Lenart's result. Our methods extend to give a recording tableau for any bumpless pipe dream.
- 13 January 2023
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 30 (1) , P1.24
Open AccessLenart's Bijection via Bumpless Pipe Dreams
Pipe dreams and bumpless pipe dreams for vexillary permutations are each known to be in bijection with certain semistandard tableaux via maps due to Lenart and Weigandt, respectively. Recently, Gao and Huang have defined a bijection between the former two sets. In this note we show for vexillary permutations that the Gao-Huang bijection preserves the associated tableaux, giving a new proof of Lenart's result. Our methods extend to give a recording tableau for any bumpless pipe dream.