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

[55]Julian Zalla, High-order substructures in random hypergraphs, PhD thesis, TU Graz, (2022). [bibtex]
[54]Michael Missethan, Global and Local Properties of Random Planar Graphs, PhD thesis, TU Graz, (2022). [bibtex]
[53]Mihyun Kang and Michael Missethan, Longest and shortest cycles in random planar graphs, Random Structures Algorithms, 60, 462–505, (2022). [bibtex] [doi]
[52]Tuan Anh Do, Joshua Erde and Mihyun Kang, A note on the width of sparse random graphs, (2022). (submitted) [bibtex]
[51]Tuan Anh Do, Joshua Erde and Mihyun Kang, Planarity and genus of sparse random bipartite graphs, SIAM J. Discrete Math., (2022). (to appear) [bibtex]
[50]Tuan Anh Do, Joshua Erde, Mihyun Kang and Michael Missethan, Component behaviour and excess of random bipartite graphs near the critical point, (2022). (submitted) [bibtex]
[49]Oliver Cooley and Julian Zalla, High-order bootstrap percolation in hypergraphs, (2022). (submitted) [bibtex]
[48]Michael Missethan, Sparse random planar graphs, Internationale Mathematische Nachrichten, Österreichische Mathematische Gesellschaft, ÖMG, 246, 29–41, (2021). [bibtex]
[47]Mihyun Kang and Michael Missethan, The early evolution of the random graph process in planar graphs and related classes, (2021). (submitted) [bibtex]
[46]Mihyun Kang and Michael Missethan, Concentration of maximum degree in random planar graphs, (2021). (submitted) [bibtex]
[45]Mihyun Kang and Michael Missethan, Local limit of sparse random planar graphs, (2021). (submitted) [bibtex]
[44]Mihyun Kang and Michael Missethan, Cut vertices in random planar graphs, In European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), Springer, (2021). (extended abstract) [bibtex]
[43]Joshua Erde, Mihyun Kang and Michael Krivelevich, Large complete minors in random subgraphs, Combinatorics, Probability and Computing, 30(4), 619–630, (2021). [bibtex] [doi]
[42]Chris Dowden, Mihyun Kang, Mirjana Mikalački and Miloš Stojaković, The game of Toucher and Isolator, In European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), Springer, (2021). (extended abstract) [bibtex]
[41]Tuan Anh Do, Joshua Erde and Mihyun Kang, Component behaviour of random bipartite graphs, In European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), Springer, (2021). (extended abstract) [bibtex]
[40]Oliver Cooley, Mihyun Kang and Julian Zalla, Loose cores and cycles in random hypergraphs, (2021). (submitted) [bibtex]
[39]Oliver Cooley, Frederik Garbe, Eng Keat Hng, Mihyun Kang, Nicolás Sanhueza-Matamala and Julian Zalla, Longest paths in random hypergraphs, SIAM J. Discrete Math., 35(4), 2430–2458, (2021). [bibtex] [doi]
[38]Oliver Cooley, Mihyun Kang and Julian Zalla, Loose cores and cycles in random hypergraphs, In European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2021), Springer, (2021). (extended abstract) [bibtex]
[37]Mihyun Kang and Michael Missethan, 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, 159, Art. 18, 15, (2020). [bibtex] [doi]
[36]Mihyun Kang, Michael Moßhammer and Philipp Sprüssel, Phase transitions in graphs on orientable surfaces, Random Structures Algorithms, 56(4), 1117–1170, (2020). [bibtex] [doi]
[35]Nicola Del Giudice, Random hypergraphs and random simplicial complexes, PhD thesis, TU Graz, (2020). [bibtex] [url]
[34]Zhicheng Gao and Mihyun Kang, 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]
[33]Nikolaos Fountoulakis, Mihyun Kang and Tamás Makai, Resolution of a conjecture on majority dynamics: rapid stabilization in dense random graphs, Random Structures Algorithms, 57(4), 1134–1156, (2020). [bibtex] [doi]
[32]Chris Dowden, Mihyun Kang and Michael Krivelevich, The genus of the Erdős-Rényi random graph and the fragile genus property, Random Structures Algorithms, 56(1), 97–121, (2020). [bibtex] [doi]
[31]Oliver Cooley, Nicola Del Giudice, Mihyun Kang and Philipp Sprüssel, Phase transition in cohomology groups of non-uniform random simplicial complexes, (2020). (submitted) [bibtex]
[30]Oliver Cooley, Nicola Del Giudice, Mihyun Kang and Philipp Sprüssel, Vanishing of cohomology groups of random simplicial complexes, Random Structures Algorithms, 56(2), 461–500, (2020). [bibtex] [doi]
[29]Oliver Cooley, Wenjie Fang, Nicola Del Giudice and Mihyun Kang, Subcritical random hypergraphs, high-order components, and hypertrees, SIAM Journal on Discrete Mathematics, 34(4), 2033–2062, (2020). [bibtex] [doi]
[28]Chris Dowden, Mihyun Kang, Michael Moßhammer and Philipp Sprüssel, 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]
[27]Chris Dowden, Mihyun Kang, Mirjana Mikalački and Miloš Stojaković, The Toucher-Isolator game, Electronic Journal of Combinatorics, 26, #P4.6:1–24, (2019). [bibtex] [doi]
[26]Oliver Cooley, Mihyun Kang and Christoph Koch, The size of the giant component in random hypergraphs: a short proof, Electronic Journal of Combinatorics, 26, #3.6:1–17, (2019). [bibtex] [doi]
[25]Oliver Cooley, Nicola Del Giudice, Mihyun Kang and Philipp Sprüssel, Cohomology groups of non-uniform random simplicial complexes, Acta Mathematica Universitatis Comenianae, 88(3), 553–560, (2019). ((extended abstract, Proc. EuroComb19)) [bibtex] [url]
[24]Oliver Cooley, Wenjie Fang, Nicola Del Giudice and Mihyun Kang, Subcritical random hypergraphs, high-order components, and hypertrees, In Proceedings of Analytic Algorithmics and Combinatorics (ANALCO19), 111–118, (2019). (extended abstract) [bibtex] [doi]
[23]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang and Kathrin Skubch, 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]
[22]Michael Moßhammer, Random graphs on surfaces, PhD thesis, TU Graz, (2018). [bibtex] [url]
[21]Mihyun Kang and Philipp Sprüssel, Symmetries of unlabelled planar triangulations, Electronic Journal of Combinatorics, 25(1), #P1.34:1–38, (2018). [bibtex] [doi]
[20]Nikolaos Fountoulakis, Mihyun Kang, Christoph Koch and Tamás Makai, 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]
[19]Wenjie Fang, Mihyun Kang, Michael Moßhammer and Philipp Sprüssel, Cubic graphs and related triangulations on orientable surfaces, Electronic Journal of Combinatorics, 25, #P1.30:1–52, (2018). [bibtex] [doi]
[18]Oliver Cooley, Mihyun Kang and Yury Person, Largest components in random hypergraphs, Combinatorics, Probability and Computing, 27(5), 741–762, (2018). [bibtex] [doi]
[17]Oliver Cooley, Mihyun Kang and Christoph Koch, The size of the giant high-order component in random hypergraphs, Random Structures Algorithms, 53(2), 238–288, (2018). [bibtex] [doi]
[16]Oliver Cooley, Nicola Del Giudice, Mihyun Kang and Philipp Sprüssel, Vanishing of cohomology groups of random simplicial complexes, In 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), 110, 7:1–7:14, (2018). (extended abstract) [bibtex] [doi]
[15]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]
[14]Oliver Cooley, Penny Haxell, Mihyun Kang and Philipp Sprüssel, Homological connectedness of random hypergraphs, Electronic Notes in Discrete Mathematics, 61, 279–285, (2017). ((extended abstract, Proc. Eurocomb17)) [bibtex] [doi]
[13]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang and Kathrin Skubch, How does the core sit inside the mantle?, Random Structures and Algorithms, 51(3), 459–482, (2017). [bibtex] [doi]
[12]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang and Kathrin Skubch, The minimum bisection in the planted bisection model, Theory of Computing, 13, Paper No. 8, 22, (2017). [bibtex] [doi]
[11]Béla Bollobás, Oliver Cooley, Mihyun Kang and Christoph Koch, Jigsaw percolation on random hypergraphs, Journal of Applied Probability, 54(4), 1261–1277, (2017). [bibtex] [doi]
[10]Christoph Koch, Phase transition phenomena in random graphs and hypergraphs, PhD thesis, TU Graz, (2016). [bibtex] [url]
[9]Mihyun Kang and Tamás Makai, 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]
[8]Oliver Cooley, Mihyun Kang and Christoph Koch, Threshold and hitting time for high-order connectedness in random hypergraphs, Electronic Journal of Combinatorics, 23, #P2.48:1–14, (2016). [bibtex] [doi]
[7]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]
[6]Mihyun Kang, Christoph Koch and Angélica Pachón, The phase transition in multitype binomial random graphs, SIAM Journal on Discrete Mathematics, 29(2), 1042–1064, (2015). [bibtex] [doi]
[5]Mihyun Kang, Michał Karoński, Christoph Koch and Tamás Makai, Properties of stochastic Kronecker graphs, Journal of Combinatorics, 6(4), 395–432, (2015). [bibtex] [doi]
[4]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]
[3]Oliver Cooley, Mihyun Kang and Christoph Koch, Evolution of high-order connected components in random hypergraphs, Electronic Notes in Discrete Mathematics, 49, 569-575, (2015). ((extended abstract, Proc. EuroComb15)) [bibtex] [doi]
[2]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang and Kathrin Skubch, The minimum bisection in the planted bisection model, In Proceedings of the 19th International Workshop on Randomization and Computation (RANDOM 2015), 40, 710–725, (2015). (extended abstract) [bibtex] [doi]
[1]Andrea Jiménez, Mihyun Kang and Martin Loebl, Directed cycle double covers: hexagon graphs, Chapter in The Seventh European Conference on Combinatorics, Graph Theory and Applications, Ed. Norm., Pisa, 16, 147–151, (2013). [bibtex] [doi]