35 citations · 185 across the 58 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
math.CO2006
On the logical complexity of convex polygon dissections
Manuel Bodirsky, Mihyun Kang, Oleg Verbitsky
The logical depth of a graph is the minimum quantifier depth of a first order sentence defining up to isomorphism in the language of the adjacency and the equality relation…
math.CO2006
The enumeration of planar graphs via Wick's theorem
Mihyun Kang, Martin Loebl
A seminal technique of theoretical physics called Wick's theorem interprets the Gaussian matrix integral of the products of the trace of powers of Hermitian matrices as the number…