Jae-Hoon Kim

From MaRDI portal
Person:557653

Available identifiers

zbMath Open kim.jaehoonMaRDI QIDQ557653

List of research outcomes

PublicationDate of PublicationType
On a rainbow extremal problem for color‐critical graphs2024-02-29Paper
Fractional Helly theorem for Cartesian products of convex sets2023-12-21Paper
Hypergraph regularity and random sampling2023-10-23Paper
2‐complexes with unique embeddings in 3‐space2023-08-23Paper
Embedding clique-factors in graphs with low \(\ell\)-independence number2023-05-02Paper
Ramsey numbers of cycles versus general graphs2023-02-21Paper
Crux and Long Cycles in Graphs2022-12-02Paper
A sharp lower bound for the spectral radius in \(K_4\)-saturated graphs2022-11-23Paper
Extremal density for sparse minors and subdivisions2022-10-27Paper
Well-mixing vertices and almost expanders2022-10-12Paper
On 1-subdivisions of transitive tournaments2022-04-04Paper
Nested cycles with no geometric crossings2022-02-16Paper
A Cvetković-type theorem for coloring of digraphs2021-11-25Paper
Resolution of the Oberwolfach problem2021-07-05Paper
The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor2021-04-12Paper
On the rational Turán exponents conjecture2021-03-08Paper
Asymptotic Structure for the Clique Density Theorem2021-01-16Paper
Rainbow structures in locally bounded colorings of graphs2020-10-26Paper
Tree decompositions of graphs without large bipartite holes2020-09-16Paper
The minimum spectral radius of \(K_{r + 1}\)-saturated graphs2020-09-10Paper
On a rainbow version of Dirac's theorem2020-07-27Paper
Spanning trees in randomly perturbed graphs2020-06-19Paper
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs2020-01-17Paper
On 1-factors with prescribed lengths in tournaments2020-01-15Paper
Optimal packings of bounded degree trees2019-12-12Paper
A bandwidth theorem for approximate decompositions2019-07-10Paper
Disjoint path covers joining prescribed source and sink sets in interval graphs2019-05-29Paper
A blow-up lemma for approximate decompositions2019-05-03Paper
Two Conjectures in Ramsey--Turán Theory2019-03-29Paper
On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families2018-12-06Paper
Forbidding induced even cycles in a graph: typical structure and counting2018-05-09Paper
Dynamic choosability of triangle‐free graphs and sparse random graphs2018-04-27Paper
Proof of Komlós's conjecture on Hamiltonian subsets2018-01-18Paper
Proof of Komlós's conjecture on Hamiltonian subsets2017-12-13Paper
Two-regular subgraphs of odd-uniform hypergraphs2017-11-28Paper
Strong edge-colorings of sparse graphs with large maximum degree2017-10-10Paper
Sparse Spanning $k$-Connected Subgraphs in Tournaments2017-09-27Paper
On the number of \(r\)-matchings in a tree2017-02-17Paper
Bipartitions of highly connected tournaments2016-10-14Paper
Bipartitions of highly connected tournaments2016-05-17Paper
On \(r\)-dynamic coloring of graphs2016-05-02Paper
Regular subgraphs of uniform hypergraphs2016-04-21Paper
Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions2016-04-15Paper
The difference and ratio of the fractional matching number and the matching number of graphs2016-01-21Paper
A Relative of Hadwiger's Conjecture2016-01-04Paper
Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs2014-09-04Paper
Equicovering subgraphs of graphs and hypergraphs2014-09-04Paper
Maximum hypergraphs without regular subgraphs2014-04-02Paper
Ramsey-minimal saturation numbers for matchings2014-02-27Paper
Average connectivity and average edge-connectivity in graphs2014-01-23Paper
New results in \(t\)-tone coloring of graphs2013-06-07Paper
Harmonious coloring of trees with large maximum degree2012-05-30Paper
Scheduling Broadcasts with Deadlines2011-03-18Paper
OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM2009-06-30Paper
Non-clairvoyant scheduling for weighted flow time2009-04-28Paper
Optimal Construction of the City Voronoi Diagram2008-04-24Paper
Maximizing the Throughput of Multiple Machines On-Line2008-01-04Paper
The swing voter's curse with adversarial preferences2007-09-14Paper
Algorithms and Computation2005-12-22Paper
Optimal broadcasting with universal lists based on competitive analysis*2005-08-05Paper
Improved gossipings by short messages in 2-dimensional meshes2005-06-30Paper
Scheduling broadcasts with deadlines2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q44740752004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44271722003-09-18Paper
Online deadline scheduling on faster machines.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q45513822002-09-05Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jae-Hoon Kim