2026 KMS Annual Meeting
Session · (DM) Discrete Mathematics
On reconfiguration graphs induced by rainbow spanning trees
I present my work at international conferences, combinatorics workshops, seminars, and public programs that bring graph theory to wider audiences.
Session · (DM) Discrete Mathematics
On reconfiguration graphs induced by rainbow spanning trees
Connectivity keeping trees in triangle-free graphs
On 2-connected graphs avoiding cycles of length 0 modulo 4
Structural properties of symmetric Toeplitz and Hankel matrices
Directed analogues of Friendship graphs
Conference moments
Talks are where ideas meet people—from a seminar room to an international conference.




Minimum degree conditions for removable matchings in k-connected graphs
A sharp extension of Halin’s removable-edge theorem to matchings
Cycles modulo 3 and 4: Extremal and Structural results
Connectivity keeping subgraph deletion problem
On 2-connected graphs avoiding cycles of length 0 modulo 4
Things I worry about as a Postdoc
Directed analogues of Friendship graphs
Digraphs in which every t vertices share exactly λ out-neighbors and exactly λ in-neighbors
Competition graphs of degree bounded digraphs
A digraph version of the Friendship Theorem
Choosing a Path in Mathematics: Research, Careers, and Opportunities
Discovering hidden connections in the World through Graphs
Careers in Mathematics: What it means to do Mathematical Research
A Mathematician's Career Path and Research