11 citations · 20 across the 3 of their papers we have counts for
4 papers
On Even Rainbow or Nontriangular Directed Cycles
Andrzej Czygrinow, Theodore Molla, Brendan Nagle +1
Let be an -vertex edge-colored graph. In 2013, H. Li proved that if every vertex is incident to at least distinctly colored edges, then admi…
On Odd Rainbow Cycles in Edge-Colored Graphs
Andrzej Czygrinow, Theodore Molla, Brendan Nagle +1
Let be an -vertex edge-colored graph. In 2013, H. Li proved that if every vertex is incident to at least distinctly colored edges, then admi…
Asymptotics of the Extremal Excedance Set Statistic
Rodrigo Ferraz de Andrade, Erik Lundberg, Brendan Nagle
Answering a question of Clark and Ehrenborg (2010), we determine asymptotics for the number of permutations of size n that admit the most common excedance set. In fact, we provide…
Tiling 3-uniform hypergraphs with K_4^3-2e
Andrzej Czygrinow, Louis DeBiasio, Brendan Nagle
Let K_4^3-2e denote the hypergraph consisting of two triples on four points. For an integer n, let t(n, K_4^3-2e) denote the smallest integer d so that every 3-uniform hypergraph G…