The following pages link to Mihyun Kang (Q322303):
Displaying 50 items.
- How does the core sit inside the mantle? (Q322305) (← links)
- Evolution of high-order connected components in random hypergraphs (Q322325) (← links)
- Characterisation of symmetries of unlabelled triangulations (Q322330) (← links)
- Bootstrap percolation in random \(k\)-uniform hypergraphs (Q322332) (← links)
- Enumeration of cubic multigraphs on orientable surfaces (Q322334) (← links)
- On the connectivity threshold of Achlioptas processes (Q482273) (← links)
- Cubic bridgeless graphs and braces (Q503640) (← links)
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- Properties of stochastic Kronecker graphs (Q890578) (← links)
- Random preorders and alignments (Q960973) (← links)
- Enumeration and asymptotic properties of unlabeled outerplanar graphs (Q1010626) (← links)
- A complete grammar for decomposing a family of graphs into 3-connected components (Q1010886) (← links)
- The enumeration of planar graphs via Wick's theorem (Q1023045) (← links)
- The evolution of the min-min random graph process (Q1043986) (← links)
- First hitting times of simple random walks on graphs with congestion points (Q1415070) (← links)
- A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs (Q1650096) (← links)
- Homological connectedness of random hypergraphs (Q1689925) (← links)
- The evolution of random graphs on surfaces (Q1689942) (← links)
- Evolution of the giant component in graphs on orientable surfaces (Q1689993) (← links)
- Cubic graphs and related triangulations on orientable surfaces (Q1700799) (← links)
- Symmetries of unlabelled planar triangulations (Q1700803) (← links)
- Evolution of a modified binomial random graph by agglomeration (Q1747676) (← links)
- Charting the replica symmetric phase (Q1749356) (← links)
- Efficiency test of pseudorandom number generators using random walks (Q1765462) (← links)
- Random walks on a finite graph with congestion points (Q1827003) (← links)
- On the connectivity of random graphs from addable classes (Q1946000) (← links)
- The size of the giant component in random hypergraphs: a short proof (Q2001987) (← links)
- Loose cores and cycles in random hypergraphs (Q2094881) (← links)
- Expansion in supercritical random subgraphs of the hypercube and its consequences (Q2105142) (← links)
- Phase transition in cohomology groups of non-uniform random simplicial complexes (Q2161217) (← links)
- Phase transitions from \(\exp( n^{1/2})\) to \(\exp(n^{2/3})\) in the asymptotics of banded plane partitions (Q2221838) (← links)
- Core forging and local limit theorems for the \(k\)-core of random graphs (Q2312608) (← links)
- The toucher-isolator game (Q2327219) (← links)
- Generating labeled planar graphs uniformly at random (Q2373725) (← links)
- Enumeration and limit laws for series-parallel graphs (Q2461767) (← links)
- Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite. (Q2488527) (← links)
- Threshold and hitting time for high-order connectedness in random hypergraphs (Q2629490) (← links)
- A direct decomposition of 3-connected planar graphs (Q2654584) (← links)
- Concentration of maximum degree in random planar graphs (Q2673490) (← links)
- On a question of Vera T. Sós about size forcing of graphons (Q2678384) (← links)
- (Q2789559) (← links)
- (Q2803960) (← links)
- Two critical periods in the evolution of random planar graphs (Q2841352) (← links)
- The Bohman-Frieze process near criticality (Q2852548) (← links)
- (Q2934614) (← links)
- Giant components in random graphs (Q2957182) (← links)
- The order of the giant component of random hypergraphs (Q3055882) (← links)
- Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions (Q3068635) (← links)
- Random unlabelled graphs containing few disjoint cycles (Q3068766) (← links)
- Boltzmann Samplers, Pólya Theory, and Cycle Pointing (Q3093621) (← links)
