Submitted / Preprint

  1. Seoyoung Kim, Chi Hoi Yip, and Semin Yoo, Explicit constructions of Diophantine tuples over finite fields, 2024.
    arXiv2404.05514Last update: April 11, 2024
  2. Michael G. DobbinsAndreas F. Holmsen, and Dohyeon Lee, Colorful intersections and Tverberg partitions, 2024.
    arXiv2403.14909Last update: March 25, 2024
  3. Alexander Clifton and Nika Salia, Saturated partial embeddings of planar graphs, 2024.
    arXiv2403.02458Last update: March 7, 2024
  4. Donggyu Kim, Baker-Bowler theory for Lagrangian Grassmannians, 2024.
    arXiv2403.02356Last update: March 6, 2024
  5. J. Pascal Gollin, Kevin Hendrey, Sang-il Oum, and Bruce Reed, Linear bounds on treewidth in terms of excluded planar minors, 2024.
    arXiv2402.17255Last update: February 28, 2024
  6. Nicolas Bousquet, Linda Cook, Laurent Feuilloley, Théo Pierron, and Sébastien Zeitoun, Local certification of forbidden subgraphs, 2024.
    arXiv2402.12148Last update: February 21, 2024
  7. Clément Dallard, Matjaž Krnc, O-joung Kwon, Martin Milanič, Andrea Munaro, Kenny Štorgel, and Sebastian Wiederrecht, Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star, 2024.
    arXiv2402.11222Last update: February 20, 2024
  8. Kevin HendreySergey NorinRaphael Steiner, and Jérémie Turcotte, Twin-width of sparse random graphs, 2023.
    arXiv2312.03688Last update: January 2, 2024
  9. Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, and Sebastian Wiederrecht, Packing even directed circuits quarter-integrally, 2023.
    arXiv2311.16816Last update: November 29, 2023
  10. Ben Lund, Thang Pham, and Le Anh Vinh, Orthogonal projections in the plane over prime order fields, 2023.
    arXiv2311.05148Last update: November 10, 2023
  11. Paige Bright, Ben Lund, and Thang Pham, On a radial projection conjecture in $\mathbb F_q^d$, 2023
    arXiv2311.05127Last update: November 10, 2023
  12. Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, and Daniël Paulusma, Computing pivot-minors, 2023.
    arXiv2311.04656Last update: November 9, 2023
  13. Romain Bourneuf, Matija Bucić, Linda Cook, and James Davies, On polynomial degree-boundedness, 2023.
    arXiv2311.03341Last update: November 7, 2023
  14. Maria Chudnovsky, Linda Cook, James Davies, and Sang-il Oum, Reuniting χ-boundedness with polynomial χ-boundedness, 2023.
    arXiv2310.11167Last update: October 18, 2023
  15. Rutger Campbell, Jim Geelen, and Matthew E. Kroeker, Average plane-size in complex-representable matroids, 2023.
    arXiv2310.02826Last update: October 5, 2023
  16. Michael Anastos and Debsoumya Chakraborti, Robust Hamiltonicity in families of Dirac graphs, 2023.
    arXiv2309.12607Last update: October 21, 2023
  17. Krishnendu Bhowmick, Ben Lund, and Oliver Roche-Newton, Large convex sets in difference sets, 2023.
    arXiv2309.07527Last update: September 19, 2023
  18. Kevin Hendrey, Sergey Norin, Raphael Steiner, and Jérémie Turcotte, On an induced version of Menger’s theorem, 2023.
    arXiv2309.07905Last update: September 15, 2023
  19. Robert Hickingbotham, Dong Yeap Kang, Sang-il Oum, Raphael Steiner, and David R. Wood, Clustered coloring of odd-H-minor-free graphs, 2023.
    Last update: September 14, 2023
  20. Donggyu Kim and Sang-il Oum, Note on Hamiltonicity of basis graphs of even delta-matroids, 2023.
    arXiv2308.05772Last update: September 15, 2023
  21. Jaewoo Jung, Jinha Kim, Minki Kim, and Yeongrak Kim, An Eisenbud-Goto type inequality for Stanley-Reisner ideals and simplicial complexes, 2023.
    arXiv2308.03338Last update: August 9, 2023
  22. Abdul Basit, Alexander Clifton, and Paul Horn, Covering triangular grids with multiplicity, 2023.
    arXiv2307.13257Last update: July 27, 2023
  23. O-joung Kwon and Xiaopan Lian, On a variant of dichromatic number for digraphs with prescribed sets of arcs, 2023.
    arXiv2307.05897Last update: July 13, 2023
  24. Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou M. Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, and Erik Jan van Leeuwen, Space-efficient parameterized algorithms on graphs of low shrubdepth, 2023.
    arXiv2307.01285Last update: July 6, 2023
  25. Kevin Hendrey, Sergey Norin, Raphael Steiner, and Jérémie Turcotte, Finding dense minors using average degree, 2023.
    arXiv2307.01184Last update: July 4, 2023
  26. Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee, and Jaehyeon Seo, Hamilton transversals in tournaments, 2023.
    arXiv2307.00912Last update: July 4, 2023
  27. Yeonsu Chang, Sejin Ko, O-joung Kwon, and Myounghwan Lee, A characterization of graphs of radius-r flip-width at most 2, 2023.
    arXiv2306.15206Last update: June 28, 2023
  28. Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, and Sang-il Oum, Twin-width of subdivisions of multigraphs, 2023.
    arXiv2306.05334Last update: June 9, 2023
  29. Dimitrios M. Thilikos and Sebastian Wiederrecht, Excluding surfaces as minors in graphs, 2023.
    arXiv2306.01724Last update: June 7, 2023
  30. António GirãoKevin Hendrey, Freddie Illingworth, Florian Lehner, Lukas Michel, Michael Savery, and Raphael Steiner, Chromatic number is not tournament-local, 2023.
    arXiv2305.15585Last update: May 27, 2023
  31. Minho Cho and Jinha Kim, Transversal numbers of stacked spheres, 2023.
    arXiv2305.08716Last update: May 16, 2023
  32. O-joung Kwon and Xiaopan Lian, Group vertex-arboricity of group-labelled graphs, 2023.
    arXiv2305.01472Last update: May 3, 2023
  33. Dimitrios M. Thilikos and Sebastian Wiederrecht, Approximating branchwidth on parametric extensions of planarity, 2023.
    arXiv2304.04517Last update: April 13, 2023
  34. J. Pascal Gollin and Sebastian Wiederrecht, Odd-Minors I: Excluding small parity breaks, 2023.
    arXiv2304.04504Last update: April 11, 2023
  35. Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc van Kreveld, Isja Mannens, and Jordi L. Vermeulen, Reconstructing graphs from connected triples, 2023.
    arXiv2303.06609Last update: April 13, 2023
  36. Tong Jin and Donggyu Kim, Orthogonal matroids over tracts, 2023.
    arXiv2303.05353Last update: March 10, 2023
  37. Debsoumya Chakraborti, Seonghyuk Im, Jaehoon Kim, Hong Liu, A bandwidth theorem for graph transversals, 2023.
    arXiv2302.09637Last update: February 21, 2023
  38. Yeonsu Chang, O-joung Kwon, and Myounghwan Lee, A new width parameter of graphs based on edge cuts: α-edge-crossing width, 2023.
    arXiv2302.04624Last update: February 10, 2023
  39. Archontia Giannopoulou, Dimitrios M. Thilikos, and Sebastian WiederrechtExcluding Single-Crossing Matching Minors in Bipartite Graphs, 2022.
    arXiv2212.09348Last update: April 13, 2023
  40. Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Donggyu Kim, and Sang-il Oum, Twin-width of random graphs, 2022.
    arXiv2212.07880Last update: December 16, 2022
  41. Stéphane Bessy, Marin BougeretDimitrios M. Thilikos, and Sebastian WiederrechtKernelization for Graph Packing Problems via Rainbow Matching, 2022.
    arXiv2207.06874Last update: April 13, 2023
  42. Duksang Lee, Nam Ho-Nguyen, and Dabeen LeeNon-smooth and Hölder-smooth Submodular Maximization, 2022.
    arXiv2210.06061Last update: October 13, 2022
  43. J. Pascal GollinKevin HendreyO-joung KwonSang-il Oum, and Youngho YooA unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups, 2022.
    arXiv2209.09488Last update: April 13, 2023
  44. Wonyeol Lee, Xavier Rival, and Hongseok Yang, Smoothness Analysis for Probabilistic Programs with Application to Optimised Variational Inference, 2022.
    arXiv2208.10530Last update: August 24, 2022
  45. Jungho Ahn, Seonghyuk Im, and Sang-il OumThe proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs, 2022.
    arXiv2208.08330Last update: August 18, 2022
  46. Jungho Ahn, Jinha Kim, and O-joung Kwon, Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes, 2022.
    arXiv2207.06660Last update: July 15, 2022
  47. Ben Lund, Thang Pham, and Vu Thi Huong Thu,  Radial projection theorems in finite spaces, 2022.
    arXiv2205.07431Last update: May 21, 2022
  48. Édouard Bonnet, O-joung Kwon, and David R. Wood, Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond), 2022.
    arXiv2202.11858Last update: February 25, 2022
  49. Linda Cook, Jake Horsfield, Myriam Preissmann, Cléophée Robin, Paul Seymour, Ni Luh Dewi Sintiari, Nicolas Trotignon, Kristina Vušković, Graphs with all holes the same length, 2021.
    arXiv2110.09970Last update: October 20, 2021
  50. Taesung Kim and O-joung Kwon, A new family of hypohamiltonian graphs generalizing Lindgren’s construction, 2021.
    Last update: December 27, 2021
  51. Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, and O-Joung Kwon, A Unifying Framework for Characterizing and Computing Width Measures, 2021.
    arXiv2109.14610Last update: October 1, 2021
  52. Marthe BonamyLinda Cook, Carla Groenland, and Alexandra WesolekA tight local algorithm for the minimum dominating set problem in outerplanar graphs, 2021.
    arXiv2108.02697Last update: August 6, 2021
  53. Dabeen Lee and Milan Vojnovic, Scheduling jobs with stochastic holding costs, 2021.
    arXiv2105.13655Last update: November 1, 2021
  54. Nathan Bowler, Christian Elbrach, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, and Maximilian Teegen, Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions, 2020.
    arXiv2012.13070Last update: February 21, 2023
  55. Debsoumya Chakraborti and Po-Shen LohLarge rainbow matchings in edge-colored graphs, 2020.
    arXiv2011.04650Last update: October 12, 2022
  56. Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, and Daniel Vaz, Vertex sparsification for edge connectivity, 2020.
    arXiv2007.07862Last update: October 6, 2020
  57. Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, and O-joung Kwon, The canonical directed tree decomposition and its applications to the directed disjoint paths problem, 2020.
    arXiv2009.13184Last update: September 29, 2020
  58. Tuan Tran, The smallest singular value of random combinatorial matrices, 2020.
    arXiv2007.06318Last update: August 2, 2020
  59. Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, and O-joung Kwon, Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth, 2020.
    arXiv2007.14179Last update: June 4, 2021
  60. Ken-ichi Kawarabayashi, Stephan KreutzerO-joung Kwon, and Qiqin Xie A half-integral Erdős-Pósa theorem for directed odd cycles, 2020.
    arXiv2007.12257Last update: October 12, 2022
  61. Dong Yeap Kang, Mihyun Kang, Jaehoon Kim, and Sang-il OumFragile minor-monotone parameters under random edge perturbation, 2020.
    arXiv2005.09897Last update: May 21, 2020
  62. Nika Salia, Christoph SpigelCasey Tompkins, and Oscar Zamora, Independent chains in acyclic posets, 2019.
    arXiv1912.03288Last update: December 11, 2019
  63. Ervin Győri, Addis Paulos, Nike Salia, Casey Tompkins, and Oscar Zamora, The maximum number of pentagons in a planar graph, 2019.
    arXiv1909.13532Last update: October 20, 2019



  1. Minho Cho, Andreas F. Holmsen, Jinha Kim, and Minki Kim, Strong Erdős-Hajnal properties in chordal graphs, Electron. J. Combin., accepted, 2024.
    arXiv2302.02417Last update: April 3, 2024
  2. Debsoumya Chakraborti and Ben Lund, Almost spanning distance trees in subsets of finite vector spaces, Bull. Lond. Math. Soc., accepted, 2024.
    doi10.1112/blms.13022 arXiv2306.12023Last update: March 20, 2024
  3. Pablo Blanco, Linda Cook, Meike Hatzel, Claire Hilaire, Freddie Illingworth, and Rose McCarty, On tree decompositions whose trees are minors, J. Graph Theory, accepted, 2024.
    doi10.1002/jgt.23083 arXiv2302.12106Last update: February 13, 2024
  4. Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen Lee, Conic mixed-binary sets: convex hull characterizations and applications, Oper. Res., accepted, 2023.
    doi10.1287/opre.2020.0827 arXiv2012.14698Last update: July 21, 2023


  1. Debsoumya Chakraborti and Da Qi Chen, Exact results on generalized Erdős-Gallai problems, European J. Combin., 120:103955, August 2024.
  2. Rutger Campbell, Florian Hörsch, and Benjamin Moore, Decompositions into two linear forests of bounded lengths, Discrete Math., 347(6):113962, June 2024.
  3. Debsoumya Chakraborti, Kevin Hendrey, Ben Lund, and Casey Tompkins, Rainbow saturation for complete graphs, SIAM J. Discrete Math., 38(1):1090-1112, 2024.
    doi10.1137/23M1565875 arXiv2212.04640Last update: March 16, 2024
  4. Donggyu Kim and Sang-il Oum, Vertex-minors of graphs: A survey, Discrete Appl. Math., 351:54-73, July 2024.
    doi10.1016/j.dam.2024.03.011Last update: March 20, 2024
  5. Alexander Clifton, New Bounds on Diffsequences, Discrete Math., 347(5):113929, May 2024.
    doi10.1016/j.disc.2024.113929 arXiv2110.10760Last update: February 23, 2024
  6. Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee, Hong Liu, and Jaehyeon Seo, On a rainbow extremal problem for color-critical graphs, Random Structures Algorithms, 64(2):460-489, March 2024.
    doi10.1002/rsa.21189 arXiv2204.02575Last update: January 25, 2024
  7. Tony Huynh and O-joung KwonOn the Erdős-Pósa property for long holes in $C_4$-free graphs, SIAM J. Discrete Math., 38(1):19-42, January 2024.
    doi10.1137/21M1435239 arXiv2105.11799Last update: January 11, 2024
  8. Manik Dhar, Zeev Dvir, and Ben Lund, Furstenberg Sets in Finite Fields: Explaining and Improving the Ellenberg–Erman Proof, Discrete Comput. Geom., 71(2):327-357, March 2024.
    doi10.1007/s00454-023-00585-y arXiv1909.02431Last update: February 5, 2024
  9. Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal GollinKevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, and David R. WoodProduct structure of graph classes with bounded treewidth, Combin. Probab. Comput., 33(3):319-350, May 2024.
  10. Lars JaffkeO-joung Kwon, and Jan Arne Telle, Classes of intersection digraphs with good algorithmic properties, J. Graph Theory, 106(1):110-148, May 2024.
    doi10.1002/jgt.23065 arXiv2105.01413Last update: March 20, 2024
  11. J. Pascal Gollin, Kevin Hendrey, Ken-ichi Kawarabayashi, O-joung Kwon, and Sang-il Oum, A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups, J. Lond. Math. Soc., 109(1):e12858, January 2024.
    doi10.1112/jlms.12858 arXiv2102.01986Last update: January 13, 2024
  12. Donggyu Kim and Sang-il Oum, Prime vertex-minors of a prime graph, European J. Combin., 118:103871, May 2024.
    doi10.1016/j.ejc.2023.103871 arXiv2202.07877Last update: November 18, 2023
  13. Archontia Giannopoulou, Stephan Kreutzer, and Sebastian Wiederrecht, Excluding a planar matching minor in bipartite graphs, J. Combin. Theory Ser. B, 164:161-221, January 2024.
    doi10.1016/j.jctb.2023.09.003Last update: November 1, 2023
  14. Alexander Clifton, Xiaonan Liu, Reem Mahmoud, and Abhinav Shantanam,  Reconstruction and Edge Reconstruction of Triangle-free Graphs, Discrete Math., 347(2):113753, February 2024.
    doi10.1016/j.disc.2023.113753 arXiv2210.00338Last update: December 15, 2023


  1. Beka Ergemlidze, Ervin GyőriAbhishek Methuku, Nike Salia, and Casey Tompkins, On 3-uniform hypergraphs avoiding a cycle of length four, 30(4):p4.5, October 2023. *
    doi10.37236/11443 arXiv2008.11372Last update: March 22, 2024
  2. Paul Jung, Hoil Lee, Jiho Lee, and Hongseok Yang, α-Stable convergence of heavy/light-tailed infinitely-wide neural networks, Adv. in Appl. Probab., 55(4):1415-1441, December 2023.
    doi10.1017/apr.2023.3Last update: January 25, 2024
  3. Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, and Hong Liu, Fractional Helly theorem for Cartesian products of convex sets, Discrete Comput. Geom., 70:1632-1651, December 2023.
    doi10.1007/s00454-022-00468-8 arXiv2108.09962Last update: December 15, 2023
  4. Hoil Lee, Fadhel Ayed, Paul Jung, Juho Lee, Hongseok Yang, and François Caron, Deep neural networks with dependent weights: Gaussian Process mixture limit, heavy tails, sparsity and compressibility, J. Mach. Learn. Res., 24(289):1−78, September 2023.
    arXiv2205.08187Last update: December 17, 2023
  5. Minki Kim and Alan Lew, Leray numbers of tolerance complexes, Combinatorica, 43(5):985-1006, October 2023.
  6. Duksang Lee and Sang-il Oum, A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors, European J. Combin., 113:103761, October 2023.
    doi10.1016/j.ejc.2023.103761 arXiv2110.10390Last update: October 2, 2023
  7. Linda Cook, Tomáš Masařík, Marcin Pilipczuk, Amadeus Reinald, and Uéverton S. Souza, Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4, Electron. J. Combin., 30(3), #P3.36, September 2023.
    doi10.37236/11538 arXiv2209.06171Last update: September 23, 2023
  8. Jungho Ahn, Eduard EibenO-joung Kwon, and Sang-il Oum, A polynomial kernel for 3-leaf power deletion, Algorithmica, 85(10):3058-3087, October 2023.
  9. Ron Aharoni, Joseph Briggs, Jinha Kim, and Minki Kim, Rainbow independent sets in certain classes of graphs, J. Graph Theory, 104(3):557-584, November 2023.
    doi10.1002/jgt.22989 arXiv1909.13143Last update: December 15, 2023
  10. Stijn Cambie, Jaehoon Kim, Hong Liu, and Tuan Tran, A proof of Frankl’s conjecture on cross-union families, Comb. Theory, 3(2):#9, September 2023.
    doi10.5070/C63261987 arXiv2202.10365Last update: December 15, 2023
  11. Rutger Campbell, Marc Distel, J. Pascal Gollin, Daniel J. Harvey, Kevin Hendrey, Robert Hickingbotham, Bojan Mohar, and David R. Wood, Graphs of Linear Growth have Bounded Treewidth, Electron. J. Combin., 30(3), #P3.1, July 2023.
    doi10.37236/11657 arXiv2210.13720Last update: July 17, 2023
  12. Debsoumya Chakraborti, Jeong Han Kim, Joonkyung Lee, and Tuan Tran, Majority dynamics on sparse random graphs, Random Structures Algorithms, 63(1):171-191, August 2023.
    doi10.1002/rsa.21139 arXiv2105.12709Last update: June 13, 2023
  13. József Balogh, Ce Chen, Kevin Hendrey, Haoran Luo, Ben Lund, Casey Tompkins, and Tuan Tran, Maximal 3-wise intersecting families, Combinatorica, 43:1045-1066, December 2023.
    doi10.1007/s00493-023-00046-3 arXiv2110.12708Last update: December 15, 2023
  14. Jaehoon Kim, Hong Liu, and Tuan TranExponential decay of intersection volume with applications on list-decodability and Gilbert-Varshamov type bound, IEEE Trans. Inform. Theory, 69(5):2841-2854, May 2023.
  15. Debsoumya Chakraborti, Extremal bipartite independence number and balanced coloring, European J. Combin., 113:103750, October 2023.
  16. Nathan Bowler, Christian Elbrach, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, and Maximilian Teegen, Ubiquity of graphs with nowhere-linear end structure, J. Graph Theory, 103(3):564-598, July 2023.
    doi10.1002/jgt.22936 arXiv1809.00602Last update: May 15, 2023
  17. Nam Ho-Nguyen, Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen LeeStrong formulations for distributionally robust chance-constrained programs with left-hand side uncertainty under Wasserstein ambiguity, INFORMS J. Optim., 5(2):131-232, May 2023. *
    doi10.1287/ijoo.2022.0083 arXiv2007.06750Last update: June 13, 2023
  18. Calum Buchanan, Alexander Clifton, Eric Culver, Jiaxi Nie, Jason O’Neill, Puck Rombach, and Mei Yin, Odd covers of graphs, J. Graph Theory, 104(2):420-439, October 2023.
    doi10.1002/jgt.22970 arXiv2202.09822Last update: August 25, 2023
  19. Dániel Grósz, Abhishek Methuku, and Casey Tompkins, Ramsey numbers of Boolean lattices, Bull. Lond. Math. Soc., 55(2):914-932, April 2023.
    doi10.1112/blms.12767 arXiv2104.02002Last update: April 13, 2023
  20. Dabeen LeeMilan Vojnovic, and Se-Young Yun, Test score algorithms for budgeted stochastic utility maximization, INFORMS J. Optim., 5(1):27-67,  2023.
    doi10.1287/ijoo.2022.0075 arXiv2012.15194Last update: April 14, 2023
  21. Donggyu Kim, Duksang Lee, and Sang-il Oum, Γ-graphic delta-matroids and their applications, Combinatorica, 43(5):963-983, October 2023.
  22. Alexander Clifton, Bishal Deb, Yifeng Huang, Sam Spiro, and Semin Yoo, Continuously Increasing Subsequences of Random Multiset Permutations, European J. Combin., 110:103708, May 2023.
  23. Duksang Lee and Sang-il Oum, Intertwining connectivities for vertex-minors and pivot-minors, SIAM J. Discrete Math., 37(1):304-314, March 2023.
    doi10.1137/22M1485073 arXiv2106.03414Last update: February 7, 2023
  24. Debsoumya Chakraborti, Alan Frieze, and Mihir Hasabnis, Colorful Hamilton cycles in random graphs, SIAM J. Discrete Math., 37(1):51-64, March 2023.
    doi10.1137/21M1403291 arXiv2103.03916Last update: February 7, 2023
  25. Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, and Máté Vizer, Turán problems for edge-ordered graphs, J. Combin. Theory Ser. B, 160:66-113, May 2023. *
  26. Ervin Győri, Nika Salia, Casey Tompkins, and Oscar Zamora, Turán numbers of Berge trees, Disc. Math., 346(4):113286, April 2023.
    doi10.1016/j.disc.2022.113286 arXiv1904.06728Last update: February 21, 2023
  27. J. Pascal Gollin and Attila Joó, Matching variables to equations in infinite linear equation systems, Linear Algebra Appl., 660:40-46, March 2023.
    doi10.1016/j.laa.2022.12.002 arXiv2211.12917Last update: December 14, 2022
  28. Donggyu Kim and Suil O, Eigenvalues and parity factors in graphs, Discrete Math., 346(4):113290, April 2023.
    doi10.1016/j.disc.2022.113290 arXiv2111.12966Last update: December 21, 2022
  29. Mamadou M. Kanté, Eun Jung Kim, O-joung Kwon, and Sang-il Oum, Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k, J. Combin. Theory Ser. B, 160:15-35, May 2023.
    doi10.1016/j.jctb.2022.12.004 arXiv2109.12291Last update: December 29, 2022
  30. Jim Geelen, O-joung Kwon, Rose McCarty, and Paul Wollan, The grid theorem for vertex-minors, J. Combin. Theory Ser. B, 158:93-116, January 2023.
    doi10.1016/j.jctb.2020.08.004 arXiv1909.08113Last update: November 29, 2022
  31. Maximilian Gorsky, Raphael Steiner, and Sebastian Wiederrecht, Matching theory and Barnette’s conjecture, Discrete Math., 346:113249, February 2023.
    doi10.1016/j.disc.2022.113249Last update: November 20, 2022
  32. Maria Axenovich, Laurin Benz, David Offner, and Casey Tompkins, Generalized Turán densities in the hypercube, Discrete Math., 346:113238, February 2023.
    doi10.1016/j.disc.2022.113238 arXiv2201.04598Last update: November 19, 2022
  33. Sang-il OumRank connectivity and pivot-minors of graphs, European J. Combin., 108:103634, February 2023.
    doi10.1016/j.ejc.2022.103634 arXiv2011.03205Last update: November 15, 2022
  34. Jeong Han Kim, Ben Lund, Thang Pham, and Semin Yoo, Threshold functions for incidence properties in finite vector spaces, Finite Fields Appl., 87:102149, March 2023.
    doi10.1016/j.ffa.2022.102149 arXiv2203.12801Last update: January 11, 2023
  35. Eun-Kyung Cho, Jinha Kim, Minki Kim, and Sang-il Oum, Independent domination of graphs with bounded maximum degree, J. Combin. Theory Ser. B, 158:341-352, January 2023.
    doi10.1016/j.jctb.2022.10.004 arXiv2202.09594Last update: November 10, 2022
  36. Matija Bucić, Benny Sudakov, and Tuan Tran, Erdős-Szekeres theorem for multidimensional arrays, J. European Math. Soc., 25(8):2927-2947, July 2023.
    doi10.4171/JEMS/1262 arXiv1910.13318Last update: July 19, 2023
  37. J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku, Casey Tompkins, and Xin Zhang, Counting cliques in 1-planar graphs, European J. Combin., 109:103654, March 2023.
    doi10.1016/j.ejc.2022.103654 arXiv2109.02906Last update: December 16, 2022


  1. Jeong-Ok Choi and Youngmi Hur, Invertibility of circulant matrices of arbitrary size, Linear and Multilinear Algebra, 70(21):7057-7074, 2022.
  2. Abhishek Methuku and István Tomon, Bipartite Turán problems for ordered graphs, Combinatorica, 42:895-911, December 2022. *
    doi10.1007/s00493-021-4296-0 arXiv1908.03189Last update: December 12, 2022
  3. Nam Ho-Nguyen, Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen Lee, Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity, Math. Program., 196:641-672, November 2022.
    doi10.1007/s10107-020-01605-y arXiv2003.12685Last update: November 10, 2022
  4. Marcelo Garlet MillaniRaphael Steiner, and Sebastian Wiederrecht, Colouring Non-Even Digraphs, Electron. J. Combin., 29(4), #P4.9, October 2022.
    doi10.37236/8800Last update: October 15, 2022
  5. J. Pascal Gollin, Karl Heuer, and Konstantinos Stavropoulos, Disjoint dijoins for classes of dicuts in finite and infinite digraphs, Combinatorial Theory, 2(3):#16, October 2022.
    doi10.5070/C62359180 arXiv2109.03518Last update: October 15, 2022
  6. Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen Lee, Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens, Math. Program., 195:283-326, September 2022.
    doi10.1007/s10107-021-01688-1 arXiv1910.01353Last update: November 8, 2022
  7. J. Pascal Gollin and Karl Heuer, Characterising k-connected sets in infinite graphs, J. Combin. Theory Ser. B, 157:451-499, November 2022.
  8. Jihoon Ko, Yunbum Kook, and Kijung ShinGrowth patterns and models of real-world hypergraphs, Knowl. Inf. Syst., 64:2883-2920, November 2022. *
    doi10.1007/s10115-022-01739-9Last update: April 7, 2023
  9. Kevin Hendrey, Sergey Norin, and David Wood, Extremal functions for sparse minors, Adv. Comb., 2022:5, 43pp, July 2022.
    doi10.19086/aic.2022.5 arXiv2107.08658Last update: July 25, 2022
  10. Jungho AhnKevin HendreyDonggyu Kim, and Sang-il Oum, Bounds for the twin-width of graphs, SIAM J. Discrete Math., 36(3):2352-2366, September 2022.
    doi10.1137/21M1452834 arXiv2110.03957Last update: April 7, 2023
  11. Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, and Hong Liu, Well-mixing vertices and almost expanders, Proc. Amer. Math. Soc., 150(12):5097-5110, December 2022.
    doi10.1090/proc/16090 arXiv2108.12864Last update: October 15, 2022
  12. Dániel Gerbner, Tamás MészárosAbhishek Methuku, and Cory Palmer, Generalized rainbow Turán problems, Electron. J. Combin., 29(2), #P2.44, June 2022. *
    doi10.37236/9964 arXiv1911.06642Last update: June 7, 2022
  13. Minki Kim and Alan Lew, Complexes of graphs with bounded independence number, Israel J. Math., 249:83-120, June 2022. *
    doi10.1007/s11856-022-2308-4 arXiv1912.12605Last update: August 26, 2022
  14. Nathan Bowler, Christian Elbrach, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian TeegenTopological ubiquity of trees, J. Combin. Theory Ser. B, 157:70-95, November 2022.
    doi10.1016/j.jctb.2022.05.011 arXiv1806.04008Last update: September 16, 2022
  15. Tuan Tran, Two problems in graph Ramsey theory, European J. Combin., 104(Article 103552), August 2022.
  16. Jungho Ahn, Lars Jaffke, O-joung Kwon, and Paloma T. Lima, Well-partitioned chordal graphs, Discrete Math., 345(10)(Article 112985), October 2022.
  17. Ervin Győri, Addis Paulos, Nike Salia, Casey Tompkins, and Oscar Zamora, The maximum number of paths of length three in a planar graph, J. Graph Theory, 101(3):493-510, September 2022.
    doi10.1002/jgt.22836 arXiv1909.13539Last update: October 15, 2022
  18. Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, and Dabeen Lee, Idealness of k-wise intersecting families, Math. Program., 192:29-50, March 2022.
  19. Ringi Kim, Sergey Norin, and Sang-il Oum, Obstructions for partitioning into forests and outerplanar graphs, Discrete Appl. Math., 312:15-28, May 2022.
  20. Jinha Kim, Minki Kim, and O-joung Kwon, Rainbow independent sets on dense graph classes, Discrete Appl. Math., 312:45-51, May 2022.
  21. Sanjeeb Dash, Oktay Günlük, and Dabeen LeeOn a generalization of the Chvátal-Gomory closure, Math. Program., 192:149-175, March 2022.
  22. Linda Cook and Paul Seymour, Detecting a long even hole, European J. Combin., 104(Article 103537), August 2022.
  23. Jinha Kim, The homotopy type of the independence complex of graphs with no induced cycle of length divisible by 3, European J. Combin., 104(Article 103534), August 2022.
  24. Ron Aharoni, Joseph Briggs, Minho Cho, and Jinha KimCooperative conditions for the existence of rainbow matchings, Electron. J. Combin., 29(1), #P1.23, January 2022.
    doi10.37236/9448 arXiv2003.08247Last update: January 28, 2022
  25. Yana Bromberg, Ariel Aptekmann, Yannick Mahlich, Linda Cook, Stefan Senn, Maximilian Miller, Vikas Nanda, Diego Ferreiro, and Paul Falkowski, Quantifying structural relationships of metal-binding sites suggests origins of biological electron transfer, Sci. Adv., 8(2):eabj3984, January 2022.
    doi10.1126/sciadv.abj3984Last update: January 17, 2022
  26. Ervin Győri, Nika Salia, Casey Tompkins, and Oscar Zamora,  Inverse Turán numbers, Discrete Math., 345(5)(Article 112779), May 2022.
  27. Martin Balko, Dániel Gerbner, Dong Yeap Kang, Younjin Kim, and Cory Palmer, Hypergraph based Berge hypergraphs, Graphs and Combinatorics, 38(11):1-13, February 2022. *
  28. Duksang Lee and Sang-il Oum, Characterizing matroids whose bases form graphic delta-matroids, European J. Combin., 101(Article 103476), March 2022.
  29. Yangyan Gu, Hal A. Kierstead, Sang-il Oum, Hao Qi, and Xuding Zhu, 3-degenerate induced subgraph of a planar graph, J. Graph Theory, 99(2):251-277, February 2022.
    doi10.1002/jgt.22740 arXiv2002.07984Last update: April 13, 2023
  30. Jungho Ahn, Eun Jung Kim, and Euiwoong Lee, Towards constant-factor approximation for chordal / distance-hereditary vertex deletion, Algorithmica, 84:2106-2133, July 2022.


  1. Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, and Máté Vizer, Vertex Turán problems for the oriented hypercube, Acta Univ. Sapientiae Math., 13(2):356-366, December 2021. *
    doi10.2478/ausm-2021-0022Last update: December 21, 2022
  2. Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, and Daniël Paulusma, Tree pivot-minors and linear rank-width, SIAM J. Discrete Math., 35(4):2922-2945, December 2021.
    doi10.1137/21M1402339 arXiv2008.00561Last update: May 21, 2022
  3. Ervin Győri, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora, Generalized planar Turán numbers, Electron. J. Combin., 28(4), #P4.32, November 2021.
    doi10.37236/9603 arXiv2002.04579Last update: December 4, 2021
  4. Jisu Jeong, Eun Jung Kim, and Sang-il Oum, Finding branch-decompositions of matroids, hypergraphs, and more, SIAM J. Discrete Math., 35(4):2544-2617, November 2021.
    doi10.1137/19M1285895 arXiv1711.01381Last update: May 21, 2022
  5. Manik Dhar, Zeev Dvir, and Ben Lund, Simple proofs for Furstenberg sets over finite fields, Discrete Analysis, 2021:22, 16pp, October 2021.
    doi10.19086/da.29067 arXiv1909.03180Last update: October 14, 2021
  6. Sanjeeb Dash, Oktay Günlük, and Dabeen Lee, Generalized Chvátal-Gomory closures for integer programs with bounds on variables, Math. Program., 190:393-425, November 2021.
    doi10.1007/s10107-020-01539-5Last update: October 9, 2021
  7. Jinha Kim, Minki Kim, and O-joung Kwon, A system of disjoint representatives of line segments with given k directions, Discrete Math., 344(12)(Article 112621), December 2021.
  8. Matija Bucić, Nemanja Draganić, Benny Sudakov, and Tuan TranUnavoidable hypergraphs, J. Combin. Theory Ser. B, 151:307-338, November 2021.
  9. Joshua Erde, J. Pascal Gollin, and Attila JoóEnlarging vertex-flames in countable digraphs, J. Combin. Theory Ser. B, 151:263-281, November 2021.
  10. J. Pascal Gollin and Karl Heuer, On the Infinite Lucchesi-Younger Conjecture I, J. Graph Theory, 98(1):27-48, September 2021.
    doi10.1002/jgt.22680 arXiv1909.08373Last update: July 14, 2021
  11. Debsoumya Chakraborti, Da Qi Chen, and Mihir Hasabnis, Minimizing the number of edges in $K_{s,t}$-saturated bipartite graphs, SIAM J. Discrete Math., 35(2):1165-1181, June 2021.
    doi10.1137/20M1368835 arXiv2009.07651Last update: June 4, 2021
  12. Debsoumya Chakraborti and Da Qi Chen, Many cliques with few edges and bounded maximum degree, J. Combin. Theory Ser. B, 151:1-20, November 2021.
  13. J. Pascal Gollin, Kevin Hendrey, Dillon Mayhew, and Sang-il Oum, Obstructions for bounded branch-depth in matroids, Adv. Comb., 2021:4, 25pp, May 2021.
    doi10.19086/aic.24227 arXiv2003.13975Last update: May 21, 2021
  14. Eduard Eiben, Robert Ganian, Thekla Hamm, and O-joung Kwon, Measuring what matters: A hybrid approach to dynamic programming with treewidth, J. Comput. System Sci., 121:57-75, November 2021.
  15. Matija Bucic, Pat Devlin, Mo Hendon, Dru Horne, and Ben Lund, Perfect matchings and derangements on graphs, J. Graph Theory, 97(2):340-354, June 2021.
    doi10.1002/jgt.22658 arXiv1906.05908Last update: April 17, 2021
  16. Maria AxenovichCasey Tompkins, and Lea Weber, Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs, J. Graph Theory, 97(1):34-46, May 2021.
    doi10.1002/jgt.22639Last update: April 17, 2021
  17. Jan Corsten and Tuan Tran, Balanced supersaturation for some degenerate hypergraphs, J. Graph Theory, 97(4):600-623, July 2021.
    doi10.1002/jgt.22674 arXiv1707.03788Last update: June 10, 2021
  18. Jaehoon Kim and Sang-il Oum, The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor, Electron. J. Combin., 28(2), P2.9, April 2021.
    doi10.37236/9536 arXiv2003.12960Last update: April 9, 2021
  19. Eun Jung Kim and O-joung Kwon, A polynomial kernel for distance-hereditary vertex deletion, Algorithmica, 83:2096-2141, July 2021.
  20. Maria Axenovich, David Offner, and Casey Tompkins, Long path and cycle decompositions of even hypercubes, European J. Combin., 95(Article 103320), June 2021.
  21. Gábor Damásdi, Balázs Keszegh, David Malec, Casey Tompkins, Zhiyu Wang, and Oscar Zamora,  Saturation problems in the Ramsey theory of graphs, posets and point sets, European J. Combin., 95(Article 103321), June 2021.
  22. Ringi Kim, Sang-il Oum, and Xin Zhang, Equitable partition of planar graphs, Discrete Math., 344(6):112351, June 2021.
  23. Ron Aharoni, Joseph Briggs, Jinha Kim, and Minki Kim, Badges and rainbow matchings, Discrete Math., 344(6):112363, June 2021.
  24. Ahmad Abdi, Gérard Cornuéjols, and Dabeen Lee, Resistant sets in the unit hypercube, Math. Oper. Res., 46(1):82-114, February 2021.
    doi10.1287/moor.2019.1048Last update: February 9, 2021
  25. O-joung Kwon, Rose McCarty, Sang-il Oum, and Paul Wollan, Obstructions for bounded shrub-depth and rank-depth, J. Combin. Theory Ser. B, 149:76-91, July 2021.
    doi10.1016/j.jctb.2021.01.005 arXiv1911.00230Last update: January 26, 2021
  26. Dong Yeap Kang, Jaehoon Kim, and Hong Liu, On the rational Turán exponents conjecture, J. Combin. Theory Ser. B, 148:149-172, May 2021.
    doi10.1016/j.jctb.2020.12.003 arXiv1811.06916Last update: February 9, 2021
  27. Joshua Erde, J. Pascal Gollin, Atilla Joó, Paul Knappe, and Max Pitz, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs, J. Combin. Theory Ser. B, 149:16-22, July 2021.
    doi10.1016/j.jctb.2021.01.004 arXiv1907.09338Last update: January 20, 2021
  28. O-joung Kwon and Jean-Florent Raymond, Packing and covering induced subdivisions, SIAM J. Discrete Math., 35(2):597-636, April 2021.
    doi10.1137/18M1226166 arXiv1803.07581Last update: April 28, 2021
  29. Jinha Kim and Minki Kim, Domination numbers and noncover complexes of hypergraphs, J. Combin. Theory Ser. A, 180(Article 105408), May 2021.
    doi10.1016/j.jcta.2021.105408 arXiv2101.01850Last update: January 29, 2021
  30. O-joung Kwon and Sang-il Oum, Graphs of bounded depth-2 rank-brittleness, J. Graph Theory, 96:361-378, March 2021.
    doi10.1002/jgt.22619 arXiv1906.05753Last update: January 16, 2021
  31. Debsoumya Chakraborti and Mihir Hasabnis, The threshold for the full perfect matching color profile in a random coloring of random graphs, Electron. J. Combin., 28(1), #P1.21, January 2021.
    doi10.37236/9066 arXiv1910.07674Last update: February 5, 2021
  32. Archontia Giannopoulou, O-joung KwonJean-Florent Raymond, and Dimitrios M. Thilikos, A Menger-like property of tree-cut width, J. Combin. Theory Ser. B, 148:1-22, May 2021.
    doi10.1016/j.jctb.2020.12.005 arXiv1808.00863Last update: December 23, 2020
  33. Reinhard Diestel and Sang-il Oum, Tangle-tree duality in abstract separation systems, Adv. Math., 377(Article 107470), January 2021.
    doi10.1016/j.aim.2020.107470 arXiv1701.02509Last update: December 11, 2020
  34. J. Pascal Gollin and Karl Heuer, An analogue of Edmonds’ Branching Theorem for infinite digraphs, European J. Combin., 92(Article 103182), February 2021.
    doi10.1016/j.ejc.2020.103182 arXiv1805.02933Last update: August 25, 2020
  35. J. Pascal Gollin and Jakob Kneip, Representations of infinite tree sets, Order, 38:79-96, April 2021.
  36. Joshua Erde, J. Pascal Gollin, Atilla Joó, Paul Knappe, and Max Pitz, Base partition for mixed families of finitary and cofinitary matroids, Combinatorica, 41:31-52, February 2021.


  1. Matt DeVosO-joung Kwon, and Sang-il Oum, Branch-depth: Generalizing tree-depth of graphs, European J. Combin., 90(Article 103186), December 2020.
  2. Huy-Tung Nguyen and Sang-il Oum, The average cut-rank of graphs, European J. Combin., 90(Article 103183), December 2020.
  3. Minjeong Kang, O-joung Kwon, and Myounghwan Lee, Graphs without two vertex-disjoint S-cycles, Discrete Math., 343(10)(Article 111997), October 2020.
  4. Dániel Gerbner, Ervin GyőriAbhishek Methuku, and Máté Vize,  Generalized Turán problems for even cycles, J. Combin. Theory Ser. B, 145:169-213, November 2020.
  5. Jürgen KritschgauAbhishek Methuku, Michael Tait, and Craig TimmonsFew H copies in F-saturated graphs, J. Graph Theory, 94:320-348, July 2020.
    doi10.1002/jgt.22525 arXiv1810.00939Last update: June 1, 2021
  6. Dániel Grósz, Abhishek Methuku, and Casey Tompkins, On subgraphs of C2k-free graphs and a problem of Kühn and Osthus, Combin. Probab. Comput., 29(3):436-454, May 2020.
    doi10.1017/S0963548319000452Last update: June 1, 2021
  7. Eun Jung Kim and O-joung KwonErdős-Pósa property of chordless cycles and its applications, J. Combin. Theory Ser. B., 145:65-112, November 2020.
  8. Beka Ergemlidze, Ervin Győri, and Abhishek Methuku, 3-Uniform hypergraphs without a cycle of length five, Electron. J. Combin. 27(2), #P2.16, May 2020.*
    doi10.37236/8806Last update: June 1, 2021
  9. Dániel Grósz, Abhishek Methuku, and Casey Tompkins, Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs, European J. Combin., 88(Article 103109), August 2020.
    doi10.1016/j.ejc.2020.103109Last update: June 1, 2021
  10. Dániel Gerbner, Abhishek Methuku, Gholamreza Omidi, and Máté Vizer,  Ramsey problems for Berge hypergraphs, SIAM J. Discrete Math., 34(1):351-369, 2020.
    doi10.1137/18M1225227Last update: June 1, 2021
  11. Dániel Gerbner, Abhishek Methuku, and Cory Palmer, General lemmas for Berge-Turán hypergraph problems, European J. Combin., 86(Article 103082), May 2020.
    doi10.1016/j.ejc.2020.103082Last update: June 1, 2021
  12. O-joung Kwon and Sang-il Oum, Scattered classes of graphs, SIAM J. Discrete Math., 34(1):972-999, 2020.
    doi10.1137/19M1293776 arXiv1801.06004Last update: April 13, 2020
  13. Benjamin Bergougnoux, Mamadou Kanté, and O-joung Kwon, An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width, Algorithimca, 82(6):1654-1674, June 2020.
  14. Kevin Hendrey and Ian M. Wanless, Covering radius in the Hamming permutation space, European J. Combin., 84(Article 103025), February 2020.
  15. Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, and Chuanqi Xiao, Set systems related to a house allocation problem, Discrete Math., 343(7)(Article 111886), July 2020.
  16. Jimeng Xiao and Casey Tompkins, On forbidden poset problems in the linear lattice, Electron. J. Combin., 27(1), #P1.18, January 2020. *
    doi10.37236/8831 arXiv1905.09246Last update: May 24, 2023
  17. Dong Yeap Kang and Jaehoon Kim, On 1-factors with prescribed lengths in tournaments, J. Combin. Theory Ser. B, 141:31-71, March 2020.
    doi10.1016/j.jctb.2019.06.003Last update: December 31, 2019
  18. Ringi KimO-joung Kwon, Sang-il Oum, and Vaidy Sivaraman, Classes of graphs with no long cycle as a vertex-minor are polynomially 𝜒-bounded, J. Combin. Theory Ser. B, 140:372-386, January 2020.
    doi10.1016/j.jctb.2019.06.001Last update: April 13, 2020


  1. Nika Salia, Casey Tompkins, Zhiyu Wang, and Oscar Zamora, Ramsey numbers of Berge-hypergraphs and related structures, Electron. J. Combin., 26(4), #P4.40, December 2019.
    doi10.37236/8892 arXiv1808.09863Last update: September 9, 2020
  2. Sean English, Dániel Gerbner, Abhishek Methuku, and Cory Palmer, On the weight of Berge-F-free hypergraphs, Electron. J. Combin. 26(4), #P4.7, October 2019.
    doi10.37236/8504Last update: June 1, 2021
  3. Lars Jaffke, O-joung Kwon, Torstein Strømme, and Jan Arne Telle, Mim-Width III: Graph powers and generalized distance domination problems, Theoret. Comput. Sci., 796:216-236, December 2019.
    doi10.1016/j.tcs.2019.09.012Last update: October 30, 2019
  4. Reinhard Diestel and Sang-il Oum, Tangle-tree duality: in graphs, matroids and beyond, Combinatorica, 39(4):879-910, August 2019.
    doi10.1007/s00493-019-3798-5Last update: October 20, 2019
  5. Dong Yeap Kang and Sang-il Oum, Improper colouring of graphs with no odd clique minor,  Combin. Probab. Comput., 28(5):740-754, September 2019.
    doi10.1017/S0963548318000548Last update: October 20, 2019
  6. Hojin ChoiIlkyoo ChoiJisu Jeong, and Sang-il Oum, Online Ramsey theory for a triangle on F-free graphs, J. Graph Theory, 92(2):152-171, October 2019.
    doi10.1002/jgt.22445Last update: October 20, 2019
IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail:, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.