3 papers
math.CO2025
Fragile minor-monotone parameters under random edge perturbation
Dong Yeap Kang, Mihyun Kang, Jaehoon Kim +1
We conduct a quantitative analysis of how many random edges need to be added to a base graph in order to significantly increase natural minor-monotone graph parameters of the r…
math.CO2025
Warning Propagation on random graphs
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +2
Warning Propagation is a combinatorial message passing algorithm that unifies and generalises a wide variety of recursive combinatorial procedures. Special cases include the Unit C…
math.CO2024
Partitioning problems via random processes
Michael Anastos, Oliver Cooley, Mihyun Kang +1
There are a number of well-known problems and conjectures about partitioning graphs to satisfy local constraints. For example, the majority colouring conjecture of Kreutzer, Oum, S…