8 citations · 23 across the 4 of their papers we have counts for
4 papers
Invertibility of digraphs and tournaments
Noga Alon, Emil Powierski, Michael Savery +2
For an oriented graph and a set , the inversion of in is the digraph obtained by reversing the orientations of the edges of with both endpoints in…
Combinatorics in the exterior algebra and the Bollobás Two Families Theorem
Alex Scott, Elizabeth Wilmer
We investigate the combinatorial structure of subspaces of the exterior algebra of a finite-dimensional real vector space, working in parallel with the extremal combinatorics of hy…
Hypergraphs of bounded disjointness
Alex Scott, Elizabeth Wilmer
A -uniform hypergraph is -almost intersecting if every edge is disjoint from exactly other edges. Gerbner, Lemons, Palmer, Patkós and Szécsi conjectured that for every $k…
A local limit theorem for a family of non-reversible Markov chains
Elizabeth L. Wilmer
By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arr…