default search action
Mihyun Kang
Person information
- affiliation: Graz University of Technology, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j72]Sahar Diskin, Joshua Erde, Mihyun Kang
, Michael Krivelevich:
Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs. Comb. 44(4): 741-784 (2024) - [j71]Amin Coja-Oghlan, Mihyun Kang
The $k$-XORSAT Threshold Revisited. Electron. J. Comb. 31(2) (2024) - [j70]Sahar Diskin, Joshua Erde, Mihyun Kang
Percolation on irregular high-dimensional product graphs. Comb. Probab. Comput. 33(3): 377-403 (2024) - [j69]David Gamarnik, Mihyun Kang, Pawel Pralat:
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process. SIAM J. Discret. Math. 38(3): 2312-2334 (2024) - 2023
- [j68]Mikhail Isaev, Mihyun Kang
On the Chromatic Number in the Stochastic Block Model. Electron. J. Comb. 30(2) (2023) - [j67]Tuan A. Do, Joshua Erde, Mihyun Kang
Component Behaviour and Excess of Random Bipartite Graphs Near the Critical Point. Electron. J. Comb. 30(3) (2023) - [j66]Mihyun Kang
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes. SIAM J. Discret. Math. 37(1): 146-162 (2023) - [i8]Amin Coja-Oghlan, Mihyun Kang
The k-XORSAT threshold revisited. CoRR abs/2301.09287 (2023) - [i7]David Gamarnik, Mihyun Kang
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process. CoRR abs/2303.13443 (2023) - 2022
- [j65]Oliver Cooley
Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes. Electron. J. Comb. 29(3) (2022) - [j64]Oliver Cooley
Loose Cores and Cycles in Random Hypergraphs. Electron. J. Comb. 29(4) (2022) - [j63]Mihyun Kang
Concentration of maximum degree in random planar graphs. J. Comb. Theory B 156: 310-342 (2022) - [j62]Mihyun Kang
Longest and shortest cycles in random planar graphs. Random Struct. Algorithms 60(3): 462-505 (2022) - [j61]Tuan A. Do, Joshua Erde, Mihyun Kang
Planarity and Genus of Sparse Random Bipartite Graphs. SIAM J. Discret. Math. 36(2): 1394-1415 (2022) - [c14]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, Jean Bernoulli Ravelomanana:
The Sparse Parity Matrix. SODA 2022: 822-833 - 2021
- [j60]Joshua Erde
Large complete minors in random subgraphs. Comb. Probab. Comput. 30(4): 619-630 (2021) - [j59]Wenjie Fang, Hsien-Kuei Hwang
Phase transitions from exp(n1/2) to exp(n2/3) in the asymptotics of banded plane partitions. J. Comb. Theory A 178: 105363 (2021) - [j58]Oliver Cooley
Large Induced Matchings in Random Graphs. SIAM J. Discret. Math. 35(1): 267-280 (2021) - [j57]Oliver Cooley
Longest Paths in Random Hypergraphs. SIAM J. Discret. Math. 35(4): 2430-2458 (2021) - 2020
- [j56]Mihyun Kang
Supersaturation problem for the bowtie. Eur. J. Comb. 88: 103107 (2020) - [j55]Michael Drmota, Mihyun Kang
Preface. Eur. J. Comb. 88: 103169 (2020) - [j54]Chris Dowden, Mihyun Kang
The genus of the Erdős-Rényi random graph and the fragile genus property. Random Struct. Algorithms 56(1): 97-121 (2020) - [j53]Oliver Cooley
Vanishing of cohomology groups of random simplicial complexes. Random Struct. Algorithms 56(2): 461-500 (2020) - [j52]Mihyun Kang
Phase transitions in graphs on orientable surfaces. Random Struct. Algorithms 56(4): 1117-1170 (2020) - [j51]Nikolaos Fountoulakis
Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs. Random Struct. Algorithms 57(4): 1134-1156 (2020) - [j50]Oliver Cooley, Wenjie Fang, Nicola Del Giudice, Mihyun Kang
Subcritical Random Hypergraphs, High-Order Components, and Hypertrees. SIAM J. Discret. Math. 34(4): 2033-2062 (2020) - [c13]Zhicheng Gao, Mihyun Kang
Counting Cubic Maps with Large Genus. AofA 2020: 13:1-13:13 - [c12]Mihyun Kang
The Giant Component and 2-Core in Sparse Random Outerplanar Graphs. AofA 2020: 18:1-18:16
2010 – 2019
- 2019
- [j49]Oliver Cooley, Mihyun Kang, Christoph Koch:
The Size of the Giant Component in Random Hypergraphs: a Short Proof. Electron. J. Comb. 26(3): 3 (2019) - [j48]Chris Dowden, Mihyun Kang, Mirjana Mikalacki
The Toucher-Isolator game. Electron. J. Comb. 26(4): 4 (2019) - [j47]Amin Coja-Oghlan, Oliver Cooley
Core forging and local limit theorems for the k-core of random graphs. J. Comb. Theory B 137: 178-231 (2019) - [c11]Oliver Cooley
Subcritical random hypergraphs, high-order components, and hypertrees. ANALCO 2019: 111-118 - 2018
- [j46]Wenjie Fang, Mihyun Kang, Michael Moßhammer, Philipp Sprüssel:
Cubic Graphs and Related Triangulations on Orientable Surfaces. Electron. J. Comb. 25(1): 1 (2018) - [j45]Mihyun Kang, Philipp Sprüssel:
Symmetries of Unlabelled Planar Triangulations. Electron. J. Comb. 25(1): 1 (2018) - [j44]Oliver Cooley
Largest Components in Random Hypergraphs. Comb. Probab. Comput. 27(5): 741-762 (2018) - [j43]Oliver Cooley
The size of the giant high-order component in random hypergraphs. Random Struct. Algorithms 53(2): 238-288 (2018) - [j42]Chris Dowden, Mihyun Kang
The Evolution of Random Graphs on Surfaces. SIAM J. Discret. Math. 32(1): 695-727 (2018) - [c10]Oliver Cooley
Vanishing of Cohomology Groups of Random Simplicial Complexes (Keynote Speakers). AofA 2018: 7:1-7:14 - [c9]Chris Dowden, Mihyun Kang
The Genus of the Erdös-Rényi Random Graph and the Fragile Genus Property. AofA 2018: 17:1-17:13 - [c8]Hsien-Kuei Hwang
Asymptotic Expansions for Sub-Critical Lagrangean Forms. AofA 2018: 29:1-29:13 - 2017
- [j41]Michael Drmota, Mihyun Kang
Preface. Electron. Notes Discret. Math. 61: 1-3 (2017) - [j40]Oliver Cooley
Homological connectedness of random hypergraphs. Electron. Notes Discret. Math. 61: 279-285 (2017) - [j39]Chris Dowden, Mihyun Kang
The evolution of random graphs on surfaces. Electron. Notes Discret. Math. 61: 367-373 (2017) - [j38]Mihyun Kang
Supersaturation Problem for the Bowtie. Electron. Notes Discret. Math. 61: 679-685 (2017) - [j37]Mihyun Kang
Evolution of the giant component in graphs on orientable surfaces. Electron. Notes Discret. Math. 61: 687-693 (2017) - [j36]Béla Bollobás, Oliver Cooley
Jigsaw percolation on random hypergraphs. J. Appl. Probab. 54(4): 1261-1277 (2017) - [j35]Amin Coja-Oghlan, Oliver Cooley
How does the core sit inside the mantle? Random Struct. Algorithms 51(3): 459-482 (2017) - [j34]Amin Coja-Oghlan, Oliver Cooley
The Minimum Bisection in the Planted Bisection Model. Theory Comput. 13(1): 1-22 (2017) - [c7]Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, Tobias Kapetanopoulos:
Charting the Replica Symmetric Phase. APPROX-RANDOM 2017: 40:1-40:17 - [i6]Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, Tobias Kapetanopoulos:
Charting the replica symmetric phase. CoRR abs/1704.01043 (2017) - [i5]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
Core forging and local limit theorems for the k-core of random graphs. CoRR abs/1707.03556 (2017) - 2016
- [j33]Oliver Cooley
Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs. Electron. J. Comb. 23(2): 2 (2016) - [j32]Andrea Jiménez
Cubic Bridgeless Graphs and Braces. Graphs Comb. 32(6): 2473-2495 (2016) - 2015
- [j31]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
'The Asymptotic Number of Connected d-Uniform Hypergraphs' - CORRIGENDUM. Comb. Probab. Comput. 24(1): 373-375 (2015) - [j30]Amin Coja-Oghlan, Oliver Cooley
How does the core sit inside the mantle? Electron. Notes Discret. Math. 49: 489-496 (2015) - [j29]Oliver Cooley
Evolution of high-order connected components in random hypergraphs. Electron. Notes Discret. Math. 49: 569-575 (2015) - [j28]Mihyun Kang
Characterisation of symmetries of unlabelled triangulations. Electron. Notes Discret. Math. 49: 587-594 (2015) - [j27]Mihyun Kang
Bootstrap percolation in random k-uniform hypergraphs. Electron. Notes Discret. Math. 49: 595-601 (2015) - [j26]Mihyun Kang
Enumeration of cubic multigraphs on orientable surfaces. Electron. Notes Discret. Math. 49: 603-610 (2015) - [j25]Mihyun Kang
The Phase Transition in Multitype Binomial Random Graphs. SIAM J. Discret. Math. 29(2): 1042-1064 (2015) - [c6]Amin Coja-Oghlan, Oliver Cooley
The Minimum Bisection in the Planted Bisection Model. APPROX-RANDOM 2015: 710-725 - [i4]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
How does the core sit inside the mantle? CoRR abs/1503.09030 (2015) - [i3]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
The minimum bisection in the planted bisection model. CoRR abs/1505.02985 (2015) - 2014
- [j24]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
Local Limit Theorems for the Giant Component of Random Hypergraphs. Comb. Probab. Comput. 23(3): 331-366 (2014) - [j23]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
The Asymptotic Number of Connected d-Uniform Hypergraphs. Comb. Probab. Comput. 23(3): 367-385 (2014) - 2013
- [j22]Mihyun Kang
On the connectivity of random graphs from addable classes. J. Comb. Theory B 103(2): 306-312 (2013) - [j21]Mihyun Kang
The Bohman-Frieze process near criticality. Random Struct. Algorithms 43(2): 221-250 (2013) - 2011
- [j20]Mihyun Kang
Untangling planar graphs from a specified vertex position - Hard cases. Discret. Appl. Math. 159(8): 789-799 (2011) - [j19]Mihyun Kang
Random unlabelled graphs containing few disjoint cycles. Random Struct. Algorithms 38(1-2): 174-204 (2011) - [j18]Manuel Bodirsky
Boltzmann Samplers, Pólya Theory, and Cycle Pointing. SIAM J. Comput. 40(3): 721-769 (2011) - [j17]Michael Drmota, Éric Fusy, Mihyun Kang
Asymptotic Study of Subcritical Graph Classes. SIAM J. Discret. Math. 25(4): 1615-1651 (2011) - 2010
- [j16]Peter J. Cameron
Random preorders and alignments. Discret. Math. 310(3): 591-603 (2010) - [j15]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
The order of the giant component of random hypergraphs. Random Struct. Algorithms 36(2): 149-184 (2010) - [j14]Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. SIAM J. Comput. 39(6): 2336-2362 (2010) - [i2]Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske:
Boltzmann Samplers, Pólya Theory, and Cycle Pointing. CoRR abs/1003.4546 (2010)
2000 – 2009
- 2009
- [j13]Amin Coja-Oghlan, Mihyun Kang
The evolution of the min-min random graph process. Discret. Math. 309(13): 4527-4544 (2009) - 2008
- [j12]Guillaume Chapuy, Éric Fusy, Mihyun Kang, Bilyana Shoilekova:
A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components. Electron. J. Comb. 15(1) (2008) - [j11]Mihyun Kang
The Critical Phase for Random Graphs with a Given Degree Sequence. Comb. Probab. Comput. 17(1): 67-86 (2008) - [j10]Manuel Bodirsky
Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms 32(2): 157-180 (2008) - [i1]Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg Verbitsky:
Obfuscated Drawings of Planar Graphs. CoRR abs/0803.0858 (2008) - 2007
- [b1]Mihyun Kang:
Random planar structures and random graph processes. HU Berlin, Germany, 2007 - [j9]Manuel Bodirsky
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. Electron. J. Comb. 14(1) (2007) - [j8]Manuel Bodirsky
Enumeration and limit laws for series-parallel graphs. Eur. J. Comb. 28(8): 2091-2105 (2007) - [j7]Mihyun Kang
Evolution of random graph processes with degree constraints. Electron. Notes Discret. Math. 28: 493-500 (2007) - [j6]Manuel Bodirsky
Random cubic planar graphs. Random Struct. Algorithms 30(1-2): 78-94 (2007) - [j5]Mihyun Kang
Phase transition of the minimum degree random multigraph process. Random Struct. Algorithms 31(3): 330-353 (2007) - [j4]Manuel Bodirsky
Generating labeled planar graphs uniformly at random. Theor. Comput. Sci. 379(3): 377-386 (2007) - [c5]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
Local Limit Theorems for the Giant Component of Random Hypergraphs. APPROX-RANDOM 2007: 341-352 - [c4]Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ICALP 2007: 789-800 - [c3]Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske:
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. SODA 2007: 356-365 - 2006
- [j3]Manuel Bodirsky
Generating Outerplanar Graphs Uniformly at Random. Comb. Probab. Comput. 15(3): 333-343 (2006) - [j2]Mihyun Kang
The connectivity threshold for the min-degree random graph process. Random Struct. Algorithms 29(1): 105-120 (2006) - 2005
- [c2]Manuel Bodirsky
Sampling Unlabeled Biconnected Planar Graphs. ISAAC 2005: 593-603 - 2004
- [j1]Mihyun Kang
Random walks on a finite graph with congestion points. Appl. Math. Comput. 153(2): 601-610 (2004) - 2003
- [c1]Manuel Bodirsky
Generating Labeled Planar Graphs Uniformly at Random. ICALP 2003: 1095-1107
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: