| A width parameter useful for chordal and co-comparability graphs DY Kang, O Kwon, TJF Strømme, JA Telle Theoretical Computer Science 704, 1-17, 2017 | 37 | 2017 |
| A relative of Hadwiger's conjecture K Edwards, DY Kang, J Kim, S Oum, P Seymour SIAM Journal on Discrete Mathematics 29 (4), 2385-2388, 2015 | 36 | 2015 |
| On the rational Turán exponents conjecture DY Kang, J Kim, H Liu Journal of Combinatorial Theory, Series B 148, 149-172, 2021 | 23 | 2021 |
| A proof of the Erdos–Faber–Lovász conjecture DY Kang, T Kelly, D Kühn, A Methuku, D Osthus arXiv preprint arXiv:2101.04698, 2021 | 23 | 2021 |
| Graph and hypergraph colouring via nibble methods: A survey DY Kang, T Kelly, D Kühn, A Methuku, D Osthus arXiv preprint arXiv:2106.13733 21, 2021 | 18 | 2021 |
| Improper colouring of graphs with no odd clique minor DY Kang, S Oum Combinatorics, Probability and Computing 28 (5), 740-754, 2019 | 17 | 2019 |
| Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor DY Kang, T Kelly, D Kühn, A Methuku, D Osthus Transactions of the American Mathematical Society 376 (09), 6623-6662, 2023 | 13 | 2023 |
| New bounds on the size of nearly perfect matchings in almost regular hypergraphs DY Kang, D Kühn, A Methuku, D Osthus Journal of the London Mathematical Society 108 (5), 1701-1746, 2023 | 8 | 2023 |
| Perfect matchings in random sparsifications of Dirac hypergraphs DY Kang, T Kelly, D Kühn, D Osthus, V Pfenninger arXiv preprint arXiv:2211.01325, 2022 | 7 | 2022 |
| On the Erdős–Ko–Rado theorem and the Bollobás theorem for t-intersecting families DY Kang, J Kim, Y Kim European Journal of Combinatorics 47, 68-74, 2015 | 7 | 2015 |
| Sparse Spanning -Connected Subgraphs in Tournaments DY Kang, J Kim, Y Kim, G Suh SIAM Journal on Discrete Mathematics 31 (3), 2206-2227, 2017 | 6 | 2017 |
| Hypergraph based Berge hypergraphs M Balko, D Gerbner, DY Kang, Y Kim, C Palmer Graphs and Combinatorics 38 (1), 11, 2022 | 4 | 2022 |
| On 1-factors with prescribed lengths in tournaments DY Kang, J Kim Journal of Combinatorial Theory, Series B 141, 31-71, 2020 | 4 | 2020 |
| A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects DY Kang, T Kelly, D Kühn, A Methuku, D Osthus 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 2 | 2022 |
| Solution to a problem of Erd\H {o} s on the chromatic index of hypergraphs with bounded codegree DY Kang, T Kelly, D Kühn, A Methuku, D Osthus arXiv preprint arXiv:2110.06181, 2021 | 2 | 2021 |
| Sparse highly connected spanning subgraphs in dense directed graphs DY Kang Combinatorics, Probability and Computing 28 (3), 423-464, 2019 | 2 | 2019 |
| A proof of the Erdös-Faber-Lovász conjecture D Kang, T Kelly, D Kühn, A Methuku, D Osthus arXiv preprint, 2021 | 1 | 2021 |
| Fragile minor-monotone parameters under random edge perturbation DY Kang, M Kang, J Kim, S Oum arXiv preprint arXiv:2005.09897, 2020 | 1 | 2020 |
| Graph decompositions and related extremal problems DY Kang 한국과학기술원, 2020 | 1 | 2020 |
| On the rational Tur\'an exponents conjecture DY Kang, J Kim, H Liu arXiv preprint arXiv:1811.06916, 2018 | 1 | 2018 |
