Submitted / Preprint
-
Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, and Sang-il Oum, Twin-width of subdivisions of multigraphs, 2023.
-
Dimitrios M. Thilikos and Sebastian Wiederrecht, Excluding surfaces as minors in graphs, 2023.
-
António Girão, Kevin Hendrey, Freddie Illingworth, Florian Lehner, Lukas Michel, Michael Savery, and Raphael Steiner, Chromatic number is not tournament-local, 2023.
-
Minho Cho and Jinha Kim, Transversal numbers of stacked spheres, 2023.
-
O-joung Kwon and Xiaopan Lian, Group vertex-arboricity of group-labelled graphs, 2023.
-
Dimitrios M. Thilikos and Sebastian Wiederrecht, Approximating branchwidth on parametric extensions of planarity, 2023.
-
J. Pascal Gollin and Sebastian Wiederrecht, Odd-Minors I: Excluding small parity breaks, 2023.
-
Donggyu Kim and Sang-il Oum, Vertex-minors of graphs, 2023.
Last update: April 5, 2023
-
Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc van Kreveld, Isja Mannens, and Jordi L. Vermeulen, Reconstructing graphs from connected triples, 2023.
-
Tong Jin and Donggyu Kim, Orthogonal matroids over tracts, 2023.
-
Pablo Blanco, Linda Cook, Meike Hatzel, Claire Hilaire, Freddie Illingworth, and Rose McCarty, On tree decompositions whose trees are minors, 2023.
-
Debsoumya Chakraborti, Seonghyuk Im, Jaehoon Kim, Hong Liu, A bandwidth theorem for graph transversals, 2023.
-
Yeonsu Chang, O-joung Kwon, and Myounghwan Lee, A new width parameter of graphs based on edge cuts: α-edge-crossing width, 2023.
-
Minho Cho, Andreas F. Holmsen, Jinha Kim, and Minki Kim, Strong Erdős-Hajnal properties in chordal graphs, 2023.
-
Rutger Campbell, Florian Hörsch, and Benjamin Moore, Decompositions into two linear forests of bounded lengths, 2023.
-
Alexander Clifton, New Bounds on Diffsequences, 2022.
-
Archontia Giannopoulou, Dimitrios M. Thilikos, and Sebastian Wiederrecht, Excluding Single-Crossing Matching Minors in Bipartite Graphs, 2022.
-
Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Donggyu Kim, and Sang-il Oum, Twin-width of random graphs, 2022.
-
Debsoumya Chakraborti, Kevin Hendrey, Ben Lund, and Casey Tompkins, Rainbow saturation for complete graphs, 2022.
-
Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, and Sebastian Wiederrecht, Kernelization for Graph Packing Problems via Rainbow Matching, 2022.
-
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, 2022.
-
Duksang Lee, Nam Ho-Nguyen, and Dabeen Lee, Non-smooth and Hölder-smooth Submodular Maximization, 2022.
-
Alexander Clifton, Xiaonan Liu, Reem Mahmoud, and Abhinav Shantanam, Reconstruction and Edge Reconstruction of Triangle-free Graphs, 2022.
-
J. Pascal Gollin, Kevin Hendrey, O-joung Kwon, Sang-il Oum, and Youngho Yoo, A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups, 2022.
-
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, 2022.
-
Wonyeol Lee, Xavier Rival, and Hongseok Yang, Smoothness Analysis for Probabilistic Programs with Application to Optimised Variational Inference, 2022.
-
Jungho Ahn, Seonghyuk Im, and Sang-il Oum, The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs, 2022.
-
Jungho Ahn, Jinha Kim, and O-joung Kwon, Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes, 2022.
-
Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, and David R. Wood, Product structure of graph classes with bounded treewidth, 2022.
-
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, 2022.
-
Ben Lund, Thang Pham, and Vu Thi Huong Thu, Radial projection theorems in finite spaces, 2022.
-
Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee, Hong Liu, and Jaehyeon Seo, On a rainbow extremal problem for color-critical graphs, 2022.
-
Stijn Cambie, Jaehoon Kim, Hong Liu, and Tuan Tran, A proof of Frankl’s conjecture on cross-union families, 2022.
-
Édouard Bonnet, O-joung Kwon, and David R. Wood, Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond), 2022.
-
Donggyu Kim and Sang-il Oum, Prime vertex-minors of a prime graph, 2022.
-
Jaehoon Kim, Hong Liu, and Tuan Tran, Exponential decay of intersection volume with applications on list–decodability and Gilbert–Varshamov type bound, 2021.
-
Kevin Hendrey, Ben Lund, Casey Tompkins, and Tuan Tran, Maximal 3-wise intersecting families, 2021.
-
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.
-
Taesung Kim and O-joung Kwon, A new family of hypohamiltonian graphs generalizing Lindgren’s construction, 2021.
Last update: December 27, 2021
-
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, and O-Joung Kwon, A Unifying Framework for Characterizing and Computing Width Measures, 2021.
-
Marthe Bonamy, Linda Cook, Carla Groenland, and Alexandra Wesolek, A tight local algorithm for the minimum dominating set problem in outerplanar graphs, 2021.
-
Debsoumya Chakraborti and Da Qi Chen, Exact results on generalized Erdős-Gallai problems, 2021.
-
Dabeen Lee and Milan Vojnovic, Scheduling jobs with stochastic holding costs, 2021.
-
Tony Huynh and O-joung Kwon, On the Erdős-Pósa property for long holes in $C_4$-free graphs, 2021.
-
Lars Jaffke, O-joung Kwon, and Jan Arne Telle, Classes of intersection digraphs with good algorithmic properties, 2021.
-
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, 2021.
-
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.
-
Debsoumya Chakraborti and Po-Shen Loh, Large rainbow matchings in edge-colored graphs, 2020.
-
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, and Daniel Vaz, Vertex sparsification for edge connectivity, 2020.
-
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.
-
Beka Ergemlidze, Ervin Győri, Abhishek Methuku, Nike Salia, and Casey Tompkins, On 3-uniform hypergraphs avoiding a cycle of length four, 2020.
-
Tuan Tran, The smallest singular value of random combinatorial matrices, 2020.
-
Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, and O-joung Kwon, Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth, 2020.
-
Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, and Qiqin Xie, A half-integral Erdős-Pósa theorem for directed odd cycles, 2020.
-
Dong Yeap Kang, Mihyun Kang, Jaehoon Kim, and Sang-il Oum, Fragile minor-monotone parameters under random edge perturbation, 2020.
-
Nika Salia, Christoph Spigel, Casey Tompkins, and Oscar Zamora, Independent chains in acyclic posets, 2019.
-
Ervin Győri, Addis Paulos, Nike Salia, Casey Tompkins, and Oscar Zamora, The maximum number of pentagons in a planar graph, 2019.
Published
Accepted
-
Duksang Lee and Sang-il Oum, A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors, European J. Combin., accepted, 2023.
-
Debsoumya Chakraborti, Extremal bipartite independence number and balanced coloring, European J. Combin., accepted, 2023.
-
Calum Buchanan, Alexander Clifton, Eric Culver, Jiaxi Nie, Jason O’Neill, Puck Rombach, and Mei Yin, Odd covers of graphs, J. Graph Theory, accepted, 2023.
-
Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen Lee, Conic mixed-binary sets: convex hull characterizations and applications, Oper. Res., accepted, 2023.
-
Ron Aharoni, Joseph Briggs, Jinha Kim, and Minki Kim, Rainbow independent sets in certain classes of graphs, J. Graph Theory, accepted, 2023.
-
Jungho Ahn, Eduard Eiben, O-joung Kwon, and Sang-il Oum, A polynomial kernel for 3-leaf power deletion, Algorithmica, accepted, 2023.
-
Minki Kim and Alan Lew, Leray numbers of tolerance complexes, Combinatorica, accepted, 2023.
-
Donggyu Kim, Duksang Lee, and Sang-il Oum, Γ-graphic delta-matroids and their applications, Combinatorica, accepted, 2023.
-
Paul Jung, Hoil Lee, Jiho Lee, and Hongseok Yang, α-Stable convergence of heavy/light-tailed infinitely-wide neural networks, Adv. in Appl. Probab., accepted, 2023.
Last update: February 13, 2023
-
Debsoumya Chakraborti, Jeong Han Kim, Joonkyung Lee, and Tuan Tran, Majority dynamics on sparse random graphs, Random Structures Algorithms, accepted, 2022.
-
Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, and Hong Liu, Fractional Helly theorem for Cartesian products of convex sets, Discrete Comput. Geom., accepted, 2022.
-
Matija Bucić, Benny Sudakov, and Tuan Tran, Erdős-Szekeres theorem for multidimensional arrays, J. European Math. Soc., accepted, 2022.
2023
-
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.
-
Nam Ho-Nguyen, Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen Lee, Strong formulations for distributionally robust chance-constrained programs with left-hand side uncertainty under Wasserstein ambiguity, INFORMS J. Optim., 5(2):131-232, May 2023. *
-
Dániel Grósz, Abhishek Methuku, and Casey Tompkins, Ramsey numbers of Boolean lattices, Bull. Lond. Math. Soc., 55(2):914-932, April 2023.
-
Dabeen Lee, Milan Vojnovic, and Se-Young Yun, Test score algorithms for budgeted stochastic utility maximization, INFORMS J. Optim., 5(1):27-67, 2023.
-
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.
-
Duksang Lee and Sang-il Oum, Intertwining connectivities for vertex-minors and pivot-minors, SIAM J. Discrete Math., 37(1):304-314, March 2023.
-
Debsoumya Chakraborti, Alan Frieze, and Mihir Hasabnis, Colorful Hamilton cycles in random graphs, SIAM J. Discrete Math., 37(1):51-64, March 2023.
-
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. *
-
Ervin Győri, Nika Salia, Casey Tompkins, and Oscar Zamora, Turán numbers of Berge trees, Disc. Math., 346(4):113286, April 2023.
-
J. Pascal Gollin and Attila Joó, Matching variables to equations in infinite linear equation systems, Linear Algebra Appl., 660:40-46, March 2023.
-
Donggyu Kim and Suil O, Eigenvalues and parity factors in graphs, Discrete Math., 346(4):113290, April 2023.
-
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.
-
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.
-
Maximilian Gorsky, Raphael Steiner, and Sebastian Wiederrecht, Matching theory and Barnette’s conjecture, Discrete Math., 346:113249, February 2023.
-
Maria Axenovich, Laurin Benz, David Offner, and Casey Tompkins, Generalized Turán densities in the hypercube, Discrete Math., 346:113238, February 2023.
-
Sang-il Oum, Rank connectivity and pivot-minors of graphs, European J. Combin., 108:103634, February 2023.
-
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.
-
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.
-
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.
2022
-
Jeong-Ok Choi and Youngmi Hur, Invertibility of circulant matrices of arbitrary size, Linear and Multilinear Algebra, 70(21):7057-7074, 2022.
-
Abhishek Methuku and István Tomon,
Bipartite Turán problems for ordered graphs, Combinatorica, 42:895-911, December 2022. *
-
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.
-
Marcelo Garlet Millani, Raphael Steiner, and Sebastian Wiederrecht, Colouring Non-Even Digraphs, Electron. J. Combin., 29(4), #P4.9, October 2022.
-
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.
-
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.
-
J. Pascal Gollin and Karl Heuer, Characterising k-connected sets in infinite graphs, J. Combin. Theory Ser. B, 157:451-499, November 2022.
-
Jihoon Ko, Yunbum Kook, and Kijung Shin, Growth patterns and models of real-world hypergraphs, Knowl. Inf. Syst., 64:2883-2920, November 2022. *
-
Kevin Hendrey, Sergey Norin, and David Wood, Extremal functions for sparse minors, Adv. Comb., 2022:5, 43pp, July 2022.
-
Jungho Ahn, Kevin Hendrey, Donggyu Kim, and Sang-il Oum, Bounds for the twin-width of graphs, SIAM J. Discrete Math., 36(3):2352-2366, September 2022.
-
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.
-
Dániel Gerbner, Tamás Mészáros, Abhishek Methuku, and Cory Palmer, Generalized rainbow Turán problems, Electron. J. Combin., 29(2), #P2.44, June 2022. *
-
Minki Kim and Alan Lew, Complexes of graphs with bounded independence number, Israel J. Math., 249:83-120, June 2022. *
-
Nathan Bowler, Christian Elbrach, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen, Topological ubiquity of trees, J. Combin. Theory Ser. B, 157:70-95, November 2022.
-
Tuan Tran, Two problems in graph Ramsey theory, European J. Combin., 104(Article 103552), August 2022.
-
Jungho Ahn, Lars Jaffke, O-joung Kwon, and Paloma T. Lima, Well-partitioned chordal graphs, Discrete Math., 345(10)(Article 112985), October 2022.
-
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.
-
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, and Dabeen Lee, Idealness of k-wise intersecting families, Math. Program., 192:29-50, March 2022.
-
Ringi Kim, Sergey Norin, and Sang-il Oum,
Obstructions for partitioning into forests and outerplanar graphs, Discrete Appl. Math., 312:15-28, May 2022.
-
Jinha Kim, Minki Kim, and O-joung Kwon, Rainbow independent sets on dense graph classes, Discrete Appl. Math., 312:45-51, May 2022.
-
Sanjeeb Dash, Oktay Günlük, and Dabeen Lee, On a generalization of the Chvátal-Gomory closure, Math. Program., 192:149-175, March 2022.
-
Linda Cook and Paul Seymour, Detecting a long even hole, European J. Combin., 104(Article 103537), August 2022.
-
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.
-
Ron Aharoni, Joseph Briggs, Minho Cho, and Jinha Kim, Cooperative conditions for the existence of rainbow matchings, Electron. J. Combin., 29(1), #P1.23, January 2022.
-
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.
-
Ervin Győri, Nika Salia, Casey Tompkins, and Oscar Zamora, Inverse Turán numbers, Discrete Math., 345(5)(Article 112779), May 2022.
-
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. *
-
Duksang Lee and Sang-il Oum, Characterizing matroids whose bases form graphic delta-matroids, European J. Combin., 101(Article 103476), March 2022.
-
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.
-
Jungho Ahn, Eun Jung Kim, and Euiwoong Lee, Towards constant-factor approximation for chordal / distance-hereditary vertex deletion, Algorithmica, 84:2106-2133, July 2022.
2021
-
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. *
-
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.
-
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.
-
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.
-
Manik Dhar, Zeev Dvir, and Ben Lund, Simple proofs for Furstenberg sets over finite fields, Discrete Analysis, 2021:22, 16pp, October 2021.
-
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.
-
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.
-
Matija Bucić, Nemanja Draganić, Benny Sudakov, and Tuan Tran, Unavoidable hypergraphs, J. Combin. Theory Ser. B, 151:307-338, November 2021.
-
Joshua Erde, J. Pascal Gollin, and Attila Joó, Enlarging vertex-flames in countable digraphs, J. Combin. Theory Ser. B, 151:263-281, November 2021.
-
J. Pascal Gollin and Karl Heuer, On the Infinite Lucchesi-Younger Conjecture I, J. Graph Theory, 98(1):27-48, September 2021.
-
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.
-
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.
-
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.
-
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.
-
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.
-
Maria Axenovich, Casey Tompkins, and Lea Weber, Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs, J. Graph Theory, 97(1):34-46, May 2021.
-
Jan Corsten and Tuan Tran, Balanced supersaturation for some degenerate hypergraphs, J. Graph Theory, 97(4):600-623, July 2021.
-
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.
-
Eun Jung Kim and O-joung Kwon, A polynomial kernel for distance-hereditary vertex deletion, Algorithmica, 83:2096-2141, July 2021.
-
Maria Axenovich, David Offner, and Casey Tompkins, Long path and cycle decompositions of even hypercubes, European J. Combin., 95(Article 103320), June 2021.
-
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.
-
Ringi Kim, Sang-il Oum, and Xin Zhang,
Equitable partition of planar graphs, Discrete Math., 344(6):112351, June 2021.
-
Ron Aharoni, Joseph Briggs, Jinha Kim, and Minki Kim, Badges and rainbow matchings, Discrete Math., 344(6):112363, June 2021.
-
Ahmad Abdi, Gérard Cornuéjols, and Dabeen Lee,
Resistant sets in the unit hypercube, Math. Oper. Res., 46(1):82-114, February 2021.
-
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.
-
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.
-
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.
-
O-joung Kwon and Jean-Florent Raymond, Packing and covering induced subdivisions, SIAM J. Discrete Math., 35(2):597-636, April 2021.
-
Jinha Kim and Minki Kim, Domination numbers and noncover complexes of hypergraphs, J. Combin. Theory Ser. A, 180(Article 105408), May 2021.
-
O-joung Kwon and Sang-il Oum,
Graphs of bounded depth-2 rank-brittleness, J. Graph Theory, 96:361-378, March 2021.
-
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.
-
Archontia Giannopoulou, O-joung Kwon, Jean-Florent Raymond, and Dimitrios M. Thilikos, A Menger-like property of tree-cut width, J. Combin. Theory Ser. B, 148:1-22, May 2021.
-
Reinhard Diestel and Sang-il Oum, Tangle-tree duality in abstract separation systems, Adv. Math., 377(Article 107470), January 2021.
-
J. Pascal Gollin and Karl Heuer, An analogue of Edmonds’ Branching Theorem for infinite digraphs, European J. Combin., 92(Article 103182), February 2021.
-
J. Pascal Gollin and Jakob Kneip, Representations of infinite tree sets, Order, 38:79-96, April 2021.
-
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.
2020
-
Matt DeVos, O-joung Kwon, and Sang-il Oum,
Branch-depth: Generalizing tree-depth of graphs, European J. Combin., 90(Article 103186), December 2020.
-
Huy-Tung Nguyen and Sang-il Oum,
The average cut-rank of graphs, European J. Combin., 90(Article 103183), December 2020.
-
Minjeong Kang, O-joung Kwon, and Myounghwan Lee,
Graphs without two vertex-disjoint S-cycles, Discrete Math., 343(10)(Article 111997), October 2020.
-
Dániel Gerbner, Ervin Győri, Abhishek Methuku, and Máté Vize, Generalized Turán problems for even cycles, J. Combin. Theory Ser. B, 145:169-213, November 2020.
-
Jürgen Kritschgau, Abhishek Methuku, Michael Tait, and Craig Timmons, Few H copies in F-saturated graphs, J. Graph Theory, 94:320-348, July 2020.
-
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.
-
Eun Jung Kim and O-joung Kwon, Erdős-Pósa property of chordless cycles and its applications, J. Combin. Theory Ser. B., 145:65-112, November 2020.
-
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.*
-
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.
-
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.
-
Dániel Gerbner, Abhishek Methuku, and Cory Palmer, General lemmas for Berge-Turán hypergraph problems, European J. Combin., 86(Article 103082), May 2020.
-
O-joung Kwon and Sang-il Oum,
Scattered classes of graphs, SIAM J. Discrete Math., 34(1):972-999, 2020.
-
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.
-
Kevin Hendrey and Ian M. Wanless,
Covering radius in the Hamming permutation space,
European J. Combin., 84(Article 103025), February 2020.
-
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.
-
Jimeng Xiao and Casey Tompkins,
On forbidden poset problems in the linear lattice, Electron. J. Combin., 27(1), #P1.18, January 2020. *
-
Dong Yeap Kang and Jaehoon Kim,
On 1-factors with prescribed lengths in tournaments,
J. Combin. Theory Ser. B, 141:31-71, March 2020.
-
Ringi Kim, O-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.
2019
-
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.
-
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.
-
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.
-
Reinhard Diestel and Sang-il Oum, Tangle-tree duality: in graphs, matroids and beyond, Combinatorica, 39(4):879-910, August 2019.
-
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.
-
Hojin Choi, Ilkyoo Choi, Jisu Jeong, and Sang-il Oum, Online Ramsey theory for a triangle on F-free graphs, J. Graph Theory, 92(2):152-171, October 2019.
