23 citations · 32 across the 6 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2015★ 1 cited
Degree switching and partitioning for enumerating graphs to arbitrary orders of accuracy
David Burstein, Jonathan Rubin
We provide a novel method for constructing asymptotics (to arbitrary accuracy) for the number of directed graphs that realize a fixed bidegree sequence with maximu…
math.CO2015
Sufficient Conditions for Graphicality of Bidegree Sequences
David Burstein, Jonathan Rubin
There are a variety of existing conditions for a degree sequence to be graphic. When a degree sequence satisfies any of these conditions, there exists a graph that realizes the seq…