Articles published by the members of the Combinatorics Group


2019

  • Oliver Cooley, Wenjie Fang, Nicola Del Giudice, and Mihyun Kang, Subcritical random hypergraphs, high-order components, and hypertrees, In the Proceedings of Analytic Algorithmics and Combinatorics (ANALCO19).

2018

  • Chris Dowden, Mihyun Kang, and Michael Krivelevich, The genus of the Erdos-Renyi random graph and the fragile genus property, In the Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018).

  • Hsien-Kuei Hwang, Mihyun Kang, and Guan-Huei Duh, Asymptotic expansions for sub-critical Lagrangean forms, In the Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018).

  • Nikolaos Fountoulakis, Mihyun Kang, Christoph Koch, and Tamas Makai, A phase transition on the evolution of bootstrap processes in inhomogeneous random graphs, Annals of Applied Probability 28 (2018), 990-1051, doi:10.1214/17-AAP1324.

  • Chris Dowden, Mihyun Kang, Philipp Sprüssel, The evolution of random graphs on surfaces, SIAM Journal on Discrete Mathematics 32 (2018), 695-727, doi:10.1137/17M113383X.

  • Oliver Cooley, Mihyun Kang, and Yury Person, Largest components in random hypergraphs, Combinatorics, Probability and Computing 27 (2018), 741-762, doi:10.1017.S096354831800010X.

  • Oliver Cooley, Mihyun Kang, and Christoph Koch, The size of the giant high-order component in random hypergraphs, Random Structures and Algorithms 53 (2018), 238-288, doi:10.1002/rsa.20761.

  • Mihyun Kang and Philipp Sprüssel, Symmetries of unlabelled planar triangulations, Electronic Journal of Combinatorics 25 (2018), #P1.34.

  • Wenjie Fang, Mihyun Kang, Michael Mosshammer, and Philipp Sprüssel, Cubic graphs and related triangulations on orientable surfaces, Electronic Journal of Combinatorics 25 (2018), #P1.30.

  • Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, Tobias Kapetanopoulos, Charting the replica symmetric phase, Communications in Mathematical Physics 359 (2018), 603-698, doi: 10.1007/s00220-018-3096-x.

  • Mihyun Kang, Angélica Pachón, and Pablo Rodriguez, Evolution of a modified binomial random graph by agglomeration, Journal of Statistical Physics 170 (2018), 509-535, doi:10.1007/s10955-017-1940-6.

2017

  • Béla Bollobás, Oliver Cooley, Mihyun Kang, and Christoph Koch, Jigsaw percolation on random hypergraphs, Journal of Applied Probability 54 (2017), 1261-1277.

  • Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch, How does the core sit inside the mantle?, Random Structures and Algorithms 51 (2017), 459-482.

  • Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch, The minimum bisection in the planted bisection model, Theory of Computing 13 (2017), 1-22.

  • Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang and Tobias Kapetanopoulos, Charting the replica symmetric phase. In the Proceedings of the 21th International Workshop on Randomization and Computation (RANDOM 2017), 40:1-40:17.

  • Chris Dowden, Mihyun Kang and Philipp Sprussel, The evolution of random graphs on surfaces. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics 61 (2017), 367-373.

  • Oliver Cooley, Penny Haxell, Mihyun Kang and Philipp Sprüssel, Homological connectedness of random hypergraphs. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics 61 (2017), 279-285.

  • Mihyun Kang, Tamas Makai and Oleg Pikhurko, Supersaturation Problem for the Bowtie. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics 61 (2017), 679-685.

  • Mihyun Kang, Michael Mosshammer, and Philipp Sprüssel, Evolution of the giant component in graphs on orientable surfaces. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Electronic Notes in Discrete Mathematics 61 (2017), 687-693.


2016

  • Chris Dowden, Extremal C4-free/C5-free planar graphs Journal of Graph Theory 83(3), 213-230 (2016).

  • Christoph Koch and Johannes Lengler, Bootstrap percolation on geometric inhomogeneous random graphs, in Proceedings of the 43nd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Vol. 55. LIPIcs, Schloss Dagstuhl, Leibniz-Zent. Inform., 2016, 147:1-147:15.

  • Oliver Cooley, Mihyun Kang, and Christoph Koch, Threshold and hitting time for high-order connectivity in random hypergraphs, Electronic Journal of Combinatorics 23 (2016), #P.48.

  • Andrea Jiménez, Mihyun Kang, and Martin Loebl, Cubic bridgeless graphs and braces, Graphs and Combinatorics (2016). doi:10.1007/s00373-016-1722-y

  • Mihyun Kang and Tamas Makai, Bootstrap percolation on G(n,p) revisited. In the Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2016), 225-236.


2015

  • Ron Aharoni, Eli Berger and Philipp Sprüssel, Two disjoint independent bases in matroid-graph pairs, Graphs and Combinatorics 31 (2015), 1107-1116.

  • Ron Aharoni, Roi Holzma, David Howard and Philipp Sprüssel, Cooperative colorings and independent systems of representatives, Electronic Journal of Combinatorics 22 (2015), 14pp.

  • Mihyun Kang, Christoph Koch, and Angélica Pachón, The phase transition in a multi-type binomial random graph, SIAM Journal on Discrete Mathematics 29 (2015), 1042-1064.

  • Mihyun Kang, Michal Karonski, Christoph Koch, and Tamas Makai, Properties of stochastic Kronecker graphs, Journal of Combinatorics 6 (2015), 395-432.

  • Mihyun Kang, Giant components in random graphs, in Recent Trends in Combinatorics, Andrew Beveridge et al. (eds.), The IMA Volumes in Mathematics and its Applications 159, Springer International Publishing Switzerland, 2015.

  • Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch, The minimum bisection in the planted bisection model. In the Proceedings of the 19th International Workshop on Randomization and Computation (RANDOM'2015), Leibniz International Proceedings in Informatics (LIPIcs), pp. 710-725, 2015.

  • Mihyun Kang and Philipp Sprüssel, Charaterisation of symmetries of unlabelled triangulations. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb15), Electronic Notes in Discrete Mathematics (2015), pp.587-594.

  • Wenjie Fang, Mihyun Kang, Michael Mosshammer, and Philipp Sprüssel, Enumeration of cubic multigraphs on orientable surfaces. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb15), Electronic Notes in Discrete Mathematics (2015), pp. 603-610.

  • Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch, How does the core sit inside the mantle?. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb15), Electronic Notes in Discrete Mathematics (2015), pp. 489-496.

  • Mihyun Kang, Christoph Koch, and Tamas Makai, Bootstrap percolation in random k-uniform hypergraphs. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb15), Electronic Notes in Discrete Mathematics (2015), pp. 595-601.

  • Oliver Cooley, Mihyun Kang, and Christoph Koch, Evolution of high-order connected components in random hypergraphs. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb15), Electronic Notes in Discrete Mathematics (2015), pp. 569-575.


2014

  • Michael Behrisch, Amin Coja-Oghlan, and Mihyun Kang, The asymptotic number of connected d-uniform hypergraphs, Combinatorics, Probability and Computing 23 (2014), 367-385.

  • Michael Behrisch, Amin Coja-Oghlan, and Mihyun Kang, Local limit theorems for the giant component of random hypergraphs, Combinatorics, Probability and Computing 23 (2014), 331-366.

  • Mihyun Kang and Konstantinos Panagiotou, On the connectivity threshold of Achlioptas processes, Journal of Combinatorics 5 (2014), 291-304.

  • Mihyun Kang and Zdeněk Petrášek, Random Graphs: Theory and Applications from Nature to Society to the Brain, Internationale Mathematische Nachrichten, Nr. 227 (2014), 1-24.

  • Mihyun Kang, Random Graphs: from Nature to Society to the Brain, a special issue of the Mathematical Intelligencer to SEOUL ICM 2014, Springer, 42-44.

  • Mihyun Kang, Angelica Pachon and Pablo Rodriguez, Connectivity for a modified binomial random graph by agglomeration. In the Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA2014), DMTCS proc. BA, 2014, pp. 217-228.


2013

  • Mihyun Kang, Will Perkins, and Joel Spencer, The Bohman-Frieze process near criticality, Random Structures and Algorithms 43 (2013), 221-250.

  • Mihyun Kang and Konstantinos Panagiotou, On the connectivity of random graphs from addable classes, Journal of Combinatorial Theory, Series B103 (2013) 306-312.

  • Andrea Jiménez, Mihyun Kang and Martin Loebl, Directed cycle double covers: hexagon graphs. In the Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb13), CRM Series 16 (2013), pp. 147-151.


2012

  • Reinhard Diestel and Philipp Sprüssel, Locally finite graphs with ends: A topological approach. III. Fundamental group and homology, Discrete Mathematics 312 (2012), 21-29.

  • Mihyun Kang and Tomasz Łuczak, Two critical periods in the evolution of random planar graphs, Transactions of the American Mathematical Society 364 (2012), 4239-4265.

  • Mihyun Kang, The 2012 Abel laureate Endre Szemerédi and his celebrated work, Internationale Mathematische Nachrichten, Nr. 221 (2012), 1-19.