5 papers · 1 filter
On the enumeration of polymatroids
Seonghyuk Im, Donggyu Kim
Let be the number of -polymatroids on . We show that for every fixed , we have \[ \left\lfloor \frac{k}{2} \right\rfloor \cdot \binom{n}{\lfloor n/2 \rfl…
Graphs whose Eulerian trails have unique labels
Donggyu Kim, Rose McCarty, Caleb McFarland
Consider an undirected graph whose edges are labeled invertibly in a group. When does every Eulerian trail from one fixed vertex to another have the same label? We give a precise s…
Pseudo-orientable ribbon graphs: Matrix--Quasi-tree Theorem and log-concavity
Changxin Ding, Donggyu Kim
One of the most important classes of even -matroids arises from orientable ribbon graphs, which play a role analogous to that of graphic matroids in matroid theory. Motivated by…
Turán's theorem for Dowling geometries
Rutger Campbell, Donggyu Kim, Jorn van der Pol
The Dowling geometry , where is a finite group, is a matroid that generalizes the complete-graphic matroid . We determine the maximum size of an -free su…
Reconstructing hypergraph matching polynomials
Donggyu Kim, Hyunwoo Lee
By utilizing the recently developed hypergraph analogue of Godsil's identity by the second author, we prove that for all , one can reconstruct the matching polynom…