Ross J. Kang

collaborators

3 papers

math.CO2026

Dirac's theorem and the switch geometry of perfect matchings

Ross J. Kang, ClÃ©ment Legrand-Duchesne

Let $G$ be a graph on an even number $n$ of vertices and let $M_{G}$ be the collection of perfect matchings in $G$ . Dirac's theorem says that if the minimum degree $I^´ (G)$ of…

math.CO2026

On Borodin-Kostochka conjecture for correspondence coloring

ZdenÄk DvoÅÃ¡k, Ross J. Kang, David MikÅ¡anÃk

Borodin and Kostochka in 1977 conjectured that if a graph $G$ has maximum degree $I^ (G) \geq 9$ and its clique number satisfies $I ¨ (G) \leq I^ (G) - 1$ , then its chromatic number satisfie…

math.CO2025

Largest component in Boolean sublattices

Julian Galliano, Ross J. Kang

For a subfamily $F \subseteq 2^{[n]}$ of the Boolean lattice, consider the graph $G_{F}$ on $F$ based on the pairwise inclusion relations among its members. Given a positive int…