Остановите войну!
for scientists:
default search action
Jaehoon Kim
- > Home > Persons > Jaehoon Kim
Publications
- 2023
- [j60]Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, Hong Liu:
Fractional Helly Theorem for Cartesian Products of Convex Sets. Discret. Comput. Geom. 70(4): 1632-1651 (2023) - [j59]Jaehoon Kim, Alexandr V. Kostochka, Suil O, Yongtang Shi, Zhiwen Wang:
A sharp lower bound for the spectral radius in K4-saturated graphs. Discret. Math. 346(2): 113231 (2023) - [j58]Fan Chang, Jie Han, Jaehoon Kim, Guanghui Wang, Donglei Yang:
Embedding clique-factors in graphs with low ℓ-independence number. J. Comb. Theory, Ser. B 161: 301-330 (2023) - [j55]Jaehoon Kim, Hong Liu, Tuan Tran:
Exponential Decay of Intersection Volume With Applications on List-Decodability and Gilbert-Varshamov Type Bound. IEEE Trans. Inf. Theory 69(5): 2841-2854 (2023) - [c43]Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev:
Conflict-free hypergraph matchings. SODA 2023: 2991-3005 - 2022
- [j53]John Haslegrave, Jie Hu, Jaehoon Kim, Hong Liu, Bingyu Luan, Guanghui Wang:
Crux and Long Cycles in Graphs. SIAM J. Discret. Math. 36(4): 2942-2958 (2022) - 2021
- [j51]Jaehoon Kim, Sang-il Oum:
The Erdős-Hajnal Property for Graphs with No Fixed Cycle as a Pivot-Minor. Electron. J. Comb. 28(2): 2 (2021) - [j49]Dong Yeap Kang, Jaehoon Kim, Hong Liu:
On the rational Turán exponents conjecture. J. Comb. Theory, Ser. B 148: 149-172 (2021) - [i5]Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, Hong Liu:
Well-mixing vertices and almost expanders. CoRR abs/2108.12864 (2021) - [i4]Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus:
Hypergraph regularity and random sampling. CoRR abs/2110.01570 (2021) - [i3]Jaehoon Kim, Hong Liu, Tuan Tran:
Exponential decay of intersection volume with applications on list-decodability and Gilbert-Varshamov type bound. CoRR abs/2112.11274 (2021) - 2020
- [j46]Jaehoon Kim, Seog-Jin Kim, Alexandr V. Kostochka, Suil O:
The minimum spectral radius of Kr+1-saturated graphs. Discret. Math. 343(11): 112068 (2020) - [j45]Dong Yeap Kang, Jaehoon Kim:
On 1-factors with prescribed lengths in tournaments. J. Comb. Theory, Ser. B 141: 31-71 (2020) - [j44]Felix Joos, Jaehoon Kim:
Spanning trees in randomly perturbed graphs. Random Struct. Algorithms 56(1): 169-219 (2020) - [j43]Jaehoon Kim, Daniela Kühn, Andrey Kupavskii, Deryk Osthus:
Rainbow structures in locally bounded colorings of graphs. Random Struct. Algorithms 56(4): 1171-1204 (2020) - [j42]Jaehoon Kim, Younjin Kim, Hong Liu:
Tree decompositions of graphs without large bipartite holes. Random Struct. Algorithms 57(1): 150-168 (2020) - 2019
- [j41]Padraig Condon, Alberto Espuny Díaz, Daniela Kühn, Deryk Osthus, Jaehoon Kim:
Resilient Degree Sequences with respect to Hamilton Cycles and Matchings in Random Graphs. Electron. J. Comb. 26(4): 4 (2019) - [j39]Jaehoon Kim, Younjin Kim, Hong Liu:
Two Conjectures in Ramsey-Turán Theory. SIAM J. Discret. Math. 33(1): 564-586 (2019) - 2018
- [j38]Ilkyoo Choi, Jaehoon Kim, Alexandr V. Kostochka, André Raspaud:
Strong edge-colorings of sparse graphs with large maximum degree. Eur. J. Comb. 67: 21-39 (2018) - [j37]Jie Han, Jaehoon Kim:
Two-regular subgraphs of odd-uniform hypergraphs. J. Comb. Theory, Ser. B 128: 175-191 (2018) - [j36]Jaehoon Kim, Daniela Kühn, Deryk Osthus, Timothy Townsend:
Forbidding induced even cycles in a graph: Typical structure and counting. J. Comb. Theory, Ser. B 131: 170-219 (2018) - [j35]Jaehoon Kim, Seongmin Ok:
Dynamic choosability of triangle-free graphs and sparse random graphs. J. Graph Theory 87(3): 347-355 (2018) - 2017
- [j34]Dong Yeap Kang, Jaehoon Kim, Younjin Kim, Hiu-Fai Law:
On the Number of r-Matchings in a Tree. Electron. J. Comb. 24(1): 1 (2017) - [j33]Jaehoon Kim, Hong Liu, Maryam Sharifzadeh, Katherine Staden:
Proof of Komlós's conjecture on Hamiltonian subsets. Electron. Notes Discret. Math. 61: 727-733 (2017) - [j31]Dong Yeap Kang, Jaehoon Kim, Younjin Kim, Geewon Suh:
Sparse Spanning k-Connected Subgraphs in Tournaments. SIAM J. Discret. Math. 31(3): 2206-2227 (2017) - [c34]Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus:
A Characterization of Testable Hypergraph Properties. FOCS 2017: 859-867 - [i2]Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus:
A characterization of testable hypergraph properties. CoRR abs/1707.03303 (2017) - 2016
- [j30]Sogol Jahanbekam, Jaehoon Kim, Suil O, Douglas B. West:
On r-dynamic coloring of graphs. Discret. Appl. Math. 206: 65-72 (2016) - [j29]Ilkyoo Choi, Jaehoon Kim, Suil O:
The difference and ratio of the fractional matching number and the matching number of graphs. Discret. Math. 339(4): 1382-1386 (2016) - [j27]Jaehoon Kim, Alexandr V. Kostochka, Xuding Zhu:
Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions. J. Graph Theory 81(4): 403-413 (2016) - [j26]Jaehoon Kim, Daniela Kühn, Deryk Osthus:
Bipartitions of Highly Connected Tournaments. SIAM J. Discret. Math. 30(2): 895-911 (2016) - 2015
- [j24]Dong Yeap Kang, Jaehoon Kim, Younjin Kim:
On the Erdős-Ko-Rado theorem and the Bollobás theorem for t-intersecting families. Eur. J. Comb. 47: 68-74 (2015) - [j23]Jaehoon Kim, Daniela Kühn, Deryk Osthus:
Bipartitions of highly connected tournaments. Electron. Notes Discret. Math. 49: 79-84 (2015) - [j19]Katherine Edwards, Dong Yeap Kang, Jaehoon Kim, Sang-il Oum, Paul D. Seymour:
A Relative of Hadwiger's Conjecture. SIAM J. Discret. Math. 29(4): 2385-2388 (2015) - 2014
- [j17]Ilkyoo Choi, Jaehoon Kim, Amelia Tebbe, Douglas B. West:
Equicovering Subgraphs of Graphs and Hypergraphs. Electron. J. Comb. 21(1): 1 (2014) - [j16]Michael Ferrara, Jaehoon Kim, Elyse Yeager:
Ramsey-minimal saturation numbers for matchings. Discret. Math. 322: 26-30 (2014) - [j15]Jaehoon Kim, Alexandr V. Kostochka:
Maximum hypergraphs without regular subgraphs. Discuss. Math. Graph Theory 34(1): 151-166 (2014) - [j14]Jaehoon Kim, Alexandr V. Kostochka, Xuding Zhu:
Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs. Eur. J. Comb. 42: 26-48 (2014) - 2013
- [j12]Daniel W. Cranston, Jaehoon Kim, William B. Kinnersley:
New Results in t-Tone Coloring of Graphs. Electron. J. Comb. 20(2): 17 (2013) - [j11]Jaehoon Kim, Suil O:
Average connectivity and average edge-connectivity in graphs. Discret. Math. 313(20): 2232-2238 (2013) - 2012
- [j8]Saieed Akbari, Jaehoon Kim, Alexandr V. Kostochka:
Harmonious coloring of trees with large maximum degree. Discret. Math. 312(10): 1633-1637 (2012) - [i1]Saieed Akbari, Jaehoon Kim, Alexandr V. Kostochka:
Harmonious Coloring of Trees with Large Maximum Degree. CoRR abs/1202.1046 (2012)
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-03-27 23:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint