3 papers
math.CO2026
Berge Hamilton cycles in a random sparsification of dense hypergraphs
Seonghyuk Im, Minseo Kim
In the standard random graph process, edges are added to an initially empty graph one by one uniformly at random. A classic result by Ajtai, Komlós, and Szemerédi, and independen…
math.CO2026
On Universal Graphs for Trees and Tree-Like Graphs
Neel Kaul, Jaehoon Kim, Minseo Kim +1
Chung and Graham [J. London Math. Soc. 1983] claimed to prove that there exists an -vertex graph with edges that contains every -vertex tr…
math.CO2025
On the size of universal graphs for spanning trees
Jaehoon Kim, Minseo Kim
Chung and Graham [J. London Math. Soc., 1983] claimed that there exists an -vertex graph containing all -vertex trees as subgraphs that has at most $\frac{5}{2}n \log_2 n…