Mihyun Kang
Research Focus: Graph Theory and Combinatorics
We study extremal graph theory and random combinatorial structures related with Stirling numbers of the first kind and the second kind.
Maximum K_r+1-free graphs which are not r-partite
Random preorders and alignments
On the logical complexity of convex polygon dissections
.
last modified: 08 October 2008
Humboldt-Universität zu Berlin
Department of Computer Science
Arbeitsgruppe:
Algorithms and Complexity
Mihyun Kang
Research
Publications
Teaching
Main page