47 citations · 678 across the 85 of their papers we have counts for
6 papers · 1 filter
Finding branch-decompositions of matroids, hypergraphs, and more
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Given subspaces of a finite-dimensional vector space over a fixed finite field , we wish to find a "branch-decomposition" of these subspaces of width at most tha…
An upper bound on tricolored ordered sum-free sets
Taegyun Kim, Sang-il Oum
We present a strengthening of the lemma on the lower bound of the slice rank by Tao (2016) motivated by the Croot-Lev-Pach-Ellenberg-Gijswijt bound on cap sets (2017, 2017). The Cr…
A remark on the paper "Properties of intersecting families of ordered sets" by O. Einstein
Sang-il Oum, Sounggun Wee
O. Einstein (2008) proved Bollobás-type theorems on intersecting families of ordered sets of finite sets and subspaces. Unfortunately, we report that the proof of a theorem on orde…
Chi-boundedness of graph classes excluding wheel vertex-minors
Hojin Choi, O-joung Kwon, Sang-il Oum +1
A class of graphs is -bounded if there exists a function such that for every graph in the class and an induced subgraph of , if …
Tangle-tree duality: in graphs, matroids and beyond
Reinhard Diestel, Sang-il Oum
We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a…
Tangle-tree duality in abstract separation systems
Reinhard Diestel, Sang-il Oum
We prove a general width duality theorem for combinatorial structures with well-defined notions of cohesion and separation. These might be graphs and matroids, but can be much more…