3 citations · 5 across the 3 of their papers we have counts for
6 papers
Some enumerative properties of parking functions
Richard P. Stanley, Mei Yin
A parking function is a sequence of positive integers such that if is the increasing rearrangement of , then f…
Odd Covers of Graphs
Calum Buchanan, Alexander Clifton, Eric Culver +4
Given a finite simple graph , an odd cover of is a collection of complete bipartite graphs, or bicliques, in which each edge of appears in an odd number of bicliques and…
Parking functions: Interdisciplinary connections
Mei Yin
Suppose that drivers each choose a preferred parking space in a linear car park with spots. In order, each driver goes to their chosen spot and parks there if possible, and…
Parking functions: From combinatorics to probability
Richard Kenyon, Mei Yin
Suppose that drivers each choose a preferred parking space in a linear car park with spots. In order, each driver goes to their chosen spot and parks there if possible, and…
Interval parking functions
Emma Colaric, Ryan DeMuse, Jeremy L. Martin +1
Interval parking functions (IPFs) are a generalization of ordinary parking functions in which each car is willing to park only in a fixed interval of spaces. Each interval parking…
Dimension reduction in vertex-weighted exponential random graphs
Ryan DeMuse, Mei Yin
We investigate the behavior of vertex-weighted exponential random graphs. We show that vertex-weighted exponential random graphs with edge weights induced by products of independen…