1 citations · 2 across the 4 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
Two-vertex generators of Jacobians of graphs
David Brandfonbrener, Pat Devlin, Netanel Friedenberg +4
We give necessary and sufficient conditions under which the Jacobian of a graph is generated by a divisor that is the difference of two vertices. This answers a question posed by B…
math.CO2017
Perfect fractional matchings in k-out hypergraphs
Pat Devlin, Jeff Kahn
Extending the notion of (random) -out graphs, we consider when the -out hypergraph is likely to have a perfect fractional matching. In particular, we show that for each t…