A. Gregory

activity

20172026

most citedPattern restricted quasi-Stirling permutations

14 citations · 16 across the 5 of their papers we have counts for

collaborators

6 papers

math.CO2026

Weakened Gallai-Ramsey Numbers for Books

Mark Budden, Adam Gregory

For $1 \leq s < t$ and any graph $G$ , the weakened Gallai-Ramsey number $g r_{s}^{t} (G)$ is defined to be the least $p \in N$ such that every Gallai $t$ -coloring of the edges of $K_…

math.GR2019

On Covers of Dihedral 2-Groups by Powerful Subgroups

Risto Atanasov, Adam Gregory, Luke Guatelli +1

A finite $p$ -group $G$ is called \textit{powerful} if either $p$ is odd and $[G, G] \subseteq G^{p}$ or $p = 2$ and $[G, G] \subseteq G^{4}$ . A {\em{cover}} for a group is a collection of su…

math.CO2018

Infinite Families of Asymmetric Graphs

Alejandra Brewer, Adam Gregory, Quindel Jones +2

A graph $G$ is \textit{asymmetric} if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963. They showed that the probability…

math.CO2018

The Asymmetric Index of a Graph

Alejandra Brewer, Adam Gregory, Quindel Jones +1

A graph $G$ is asymmetric if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963 where they measured the degree of asymmetry…

math.CO2018★ 14 cited

Pattern restricted quasi-Stirling permutations

Kassie Archer, Adam Gregory, Bryan Pennington +1

We define a variation of Stirling permutations, called quasi-Stirling permutations, to be permutations on the multiset ${1, 1, 2, 2, \dots, n, n}$ that avoid the patterns 1212 and 21…

math.CO2017★ 2 cited

Edge-Transitive Graphs

Heather A. Newman, Hector Miranda, Darren A. Narayan

A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. I…