2 citations · 2 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2023
Complexity of quiver mutation equivalence
David Soukup
We prove results for determining whether quivers are mutation equivalent to quivers with given properties. Specifically, determining whether a quiver is muta…
math.CO2017★ 2 cited
Embeddings of weighted graphs in Erdős-type settings
David M. Soukup
Many recent results in combinatorics concern the relationship between the size of a set and the number of distances determined by pairs of points in the set. One extension of this…