Reminder

In all DK related publications, it is required to acknowledge support of the FWF. The following naming convention must be used in all cases:

    Austrian Science Fund (FWF): W1230

For example, you may include a sentence such as "The author acknowledges the support of the Austrian Science Fund (FWF): W1230." Please do not forget!

Project 15:
Random graphs on a surface

2015
[49]Cooley, Oliver, Kang, Mihyun and Koch, Christoph, Evolution of high-order connected components in random hypergraphs, Electronic Notes in Discrete Mathematics, 49, 569-575, (2015). ((extended abstract, Proc.\ EuroComb15)) [bibtex] [doi]
[48]Wenjie Fang, Mihyun Kang, Michael Moßhammer and Philipp Sprüssel, Enumeration of cubic multigraphs on orientable surfaces, Electronic Notes in Discrete Mathematics, 49, 603-610, (2015). ((extended abstract, Proc.\ EuroComb15)) [bibtex] [doi]
[47]Mihyun Kang, Christoph Koch and Tamás Makai, Bootstrap percolation in random $k$-uniform hypergraphs, Electronic Notes in Discrete Mathematics, 49, 595-601, (2015). ((extended abstract, Proc.\ EuroComb15)) [bibtex] [doi]
[46]Kang, Mihyun, Karoński, Michał, Koch, Christoph and Makai, Tamás, Properties of stochastic Kronecker graphs, Journal of Combinatorics, 6(4), 395–432, (2015). [bibtex] [doi]
[45]Kang, Mihyun, Koch, Christoph and Pachón, Angélica, The phase transition in multitype binomial random graphs, SIAM Journal on Discrete Mathematics, 29(2), 1042–1064, (2015). [bibtex] [doi]
[44]Coja-Oghlan, Amin, Cooley, Oliver, Kang, Mihyun and Skubch, Kathrin, The minimum bisection in the planted bisection model (Extended abstract), In Proceedings of the 19th International Workshop on Randomization and Computation (RANDOM 2015), 40, 710–725, (2015). [bibtex] [doi]
2016
[43]Cooley, Oliver, Kang, Mihyun and Koch, Christoph, Threshold and hitting time for high-order connectedness in random hypergraphs, Electronic Journal of Combinatorics, 23(2), \#P2.48, (2016). [bibtex] [doi]
[42]Kang, Mihyun and Makai, Tamás, Bootstrap percolation on ${G}(n,p)$ revisited, In 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2016), 225–236, (2016). [bibtex]
[41]Koch, Christoph, Phase transition phenomena in random graphs and hypergraphs, PhD thesis, TU Graz, (2016). [bibtex] [url]
2017
[40]Bollobás, Béla, Cooley, Oliver, Kang, Mihyun and Koch, Christoph, Jigsaw percolation on random hypergraphs, Journal of Applied Probability, 54(4), 1261–1277, (2017). [bibtex] [doi]
[39]Cooley, Oliver, Haxell, Penny, Kang, Mihyun and Sprüssel, Philipp, Homological connectedness of random hypergraphs, Electronic Notes in Discrete Mathematics, 61, 279–285, (2017). ((extended abstract, Proc.\ Eurocomb17)) [bibtex] [doi]
[38]Coja-Oghlan, Amin, Cooley, Oliver, Kang, Mihyun and Skubch, Kathrin, The minimum bisection in the planted bisection model, Theory of Computing, 13, Paper No. 8, 22, (2017). [bibtex] [doi]
[37]Coja-Oghlan, Amin, Cooley, Oliver, Kang, Mihyun and Skubch, Kathrin, How does the core sit inside the mantle?, Random Structures and Algorithms, 51(3), 459–482, (2017). [bibtex] [doi]
[36]Mihyun Kang, Michael Moßhammer and Philipp Sprüssel, Evolution of the giant component in graphs on orientable surfaces, Electronic Notes in Discrete Mathematics, 61, 687-693, (2017). ((extended abstract, Proc.\ Eurocomb17)) [bibtex] [doi]
2018
[35]Cooley, Oliver, Del Giudice, Nicola, Kang, Mihyun and Sprüssel, Philipp, Vanishing of cohomology groups of random simplicial complexes (Extended abstract), In 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), 110, 7:1–7:14, (2018). [bibtex] [doi]
[34]Cooley, Oliver, Kang, Mihyun and Koch, Christoph, The size of the giant high-order component in random hypergraphs, Random Structures and Algorithms, 53(2), 238–288, (2018). [bibtex] [doi]
[33]Cooley, Oliver, Kang, Mihyun and Person, Yury, Largest components in random hypergraphs, Combinatorics, Probability and Computing, 27(5), 741–762, (2018). [bibtex] [doi]
[32]Fountoulakis, Nikolaos, Kang, Mihyun, Koch, Christoph and Makai, Tamás, A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs, The Annals of Applied Probability, 28(2), 990–1051, (2018). [bibtex] [doi]
[31]Kang, Mihyun, Symmetries of unlabelled planar triangulations, Electronic Journal of Combinatorics, 25(1), \#P1.34, (2018). [bibtex] [doi]
[30]Fang, Wenjie, Kang, Mihyun, Moßhammer, Michael and Sprüssel, Philipp, Cubic graphs and related triangulations on orientable surfaces, Electronic Journal of Combinatorics, 25(1), \#P1.30, (2018). [bibtex] [doi]
[29], Random graphs on surfaces, PhD thesis, TU Graz, (2018). [bibtex] [url]
2019
[28]Coja-Oghlan, Amin, Cooley, Oliver, Kang, Mihyun and Skubch, Kathrin, Core forging and local limit theorems for the $k$-core of random graphs, Journal of Combinatorial Theory, Series B, 137, 178–231, (2019). [bibtex] [doi]
[27]Cooley, Oliver, Fang, Wenjie, Del Giudice, Nicola and Kang, Mihyun, Subcritical random hypergraphs, high-order components, and hypertrees (Extended abstract), In Proceedings of Analytic Algorithmics and Combinatorics (ANALCO19), 111–118, (2019). [bibtex] [doi]
[26]Cooley, Oliver, Del Giudice, Nicola, Kang, Mihyun and Sprüssel, Philipp, Cohomology groups of non-uniform random simplicial complexes, Acta Mathematica Universitatis Comenianae, 88(3), 553–560, (2019). ((extended abstract, Proc.\ EuroComb19)) [bibtex] [url]
[25]Cooley, Oliver, Kang, Mihyun and Koch, Christoph, The size of the giant component in random hypergraphs: a short proof, Electronic Journal of Combinatorics, 26(3), \#P3.6, (2019). [bibtex] [doi]
[24]Dowden, Chris, Kang, Mihyun, Mikalački, Mirjana and Stojaković, Miloš, The Toucher-Isolator game, Electronic Journal of Combinatorics, 26(4), \#P4.6, (2019). [bibtex] [doi]
[23]Dowden, Chris, Kang, Mihyun, Moßhammer, Michael and Sprüssel, Philipp, The evolution of random graphs on surfaces of non-constant genus, Acta Mathematica Universitatis Comenianae, 88(3), 631–636, (2019). ((extended abstract, Proc.\ EuroComb19)) [bibtex] [url]
2020
[22]Cooley, Oliver, Fang, Wenjie, Del Giudice, Nicola and Kang, Mihyun, Subcritical random hypergraphs, high-order components, and hypertrees, SIAM Journal on Discrete Mathematics, 34(4), 2033–2062, (2020). [bibtex] [doi]
[21]Cooley, Oliver, Del Giudice, Nicola, Kang, Mihyun and Sprüssel, Philipp, Vanishing of cohomology groups of random simplicial complexes, Random Structures Algorithms, 56(2), 461–500, (2020). [bibtex] [url] [doi]
[20]Dowden, Chris, Kang, Mihyun and Krivelevich, Michael, The genus of the Erd\Hos-Rényi random graph and the fragile genus property, Random Structures Algorithms, 56(1), 97–121, (2020). [bibtex] [url] [doi]
[19]Fountoulakis, Nikolaos, Kang, Mihyun and Makai, Tamás, Resolution of a conjecture on majority dynamics: rapid stabilization in dense random graphs, Random Structures Algorithms, 57(4), 1134–1156, (2020). [bibtex] [url] [doi]
[18]Gao, Zhicheng and Kang, Mihyun, Counting cubic maps with large genus, Chapter in 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 159, Art. 13, 12, (2020). [bibtex] [doi]
[17]Kang, Mihyun and Missethan, Michael, The giant component and 2-core in sparse random outerplanar graphs, Chapter in 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 159, Art. 18, 15, (2020). [bibtex] [doi]
[16]Kang, Mihyun and Moßhammer, Michael and Sprüssel, Philipp, Phase transitions in graphs on orientable surfaces, Random Structures and Algorithms, 56(4), 1117–1170, (2020). [bibtex] [doi]
[15]Cooley, Oliver, Del Giudice, Nicola, Kang, Mihyun and Sprüssel, Philipp, Phase transition in cohomology groups of non-uniform random simplicial complexes, (2020). (submitted) [bibtex]
[14]Nicola Del Giudice, Random hypergraphs and random simplicial complexes, PhD thesis, TU Graz, (2020). [bibtex] [url]
[13]Do, Tuan Anh, Erde, Joshua and Kang, Mihyun, Planarity and genus of sparse random bipartite graphs, (2020). (submitted) [bibtex]
2021
[12]Cooley, Oliver, Kang, Mihyun and Zalla, Julian, Loose cores and cycles in random hypergraphs, (2021). (submitted) [bibtex]
[11]Cooley, Oliver, Kang, Mihyun and Zalla, Julian, Loose cores and cycles in random hypergraphs (extended abstract), In European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), Springer, (2021). [bibtex]
[10]Do, Tuan Anh, Erde, Joshua and Kang, Mihyun, Component behaviour of random bipartite graphs (extended abstract), In European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), Springer, (2021). [bibtex]
[9]Do, Tuan Anh, Erde, Joshua and Kang, Mihyun, Component behaviour and excess of random bipartite graphs near the critical point, (2021). (submitted) [bibtex]
[8]Dowden, Chris, Kang, Mihyun, Mikalački, Mirjana and Stojaković, Miloš, The game of Toucher and Isolator (extended abstract), In European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), Springer, (2021). [bibtex]
[7]Erde, Joshua, Kang, Mihyun and Krivelevich, Michael, Large complete minors in random subgraphs, Combin. Probab. Comput., 30(4), 619–630, (2021). [bibtex] [url] [doi]
[6]Kang, Mihyun and Missethan, Michael, Cut vertices in random planar graphs (extended abstract), In European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), Springer, (2021). [bibtex]
[5]Kang, Mihyun and Missethan, Michael, Local limit of sparse random planar graphs, (2021). (submitted) [bibtex]
[4]Kang, Mihyun and Missethan, Michael, Concentration of maximum degree in random planar graphs, (2021). (submitted) [bibtex]
[3]Missethan, Michael, Sparse random planar graphs, Internationale Mathematische Nachrichten, Österreichische Mathematische Gesellschaft, ÖMG, 246, 29–41, (2021). [bibtex]
[2]Cooley, Oliver, Garbe, Frederik, Hng, Eng Keat, Kang, Mihyun, Sanhueza-Matamala, Nicolás and Zalla, Julian, Longest paths in random hypergraphs, (2021). (accepted for publication in SIAM J. Discrete Math.) [bibtex]
[1]Kang, Mihyun and Missethan, Michael, Longest and shortest cycles in random planar graphs, Random Structures and Algorithms, 1–44, (2021). [bibtex] [url] [doi]