Searcharxiv⌕ Search

arXiv subjects

Sang-il Oum

Publications and source records attributed to Sang-il Oum.

At least 19 recordsLinked to original sources

Multiway Partition is FPT for Connectivity Functions

Let $E$ be a set of $n$ elements, $f\colon2^E\to\mathbb Z_{\ge0}$ be submodular, $t_1,\ldots,t_r\in E$ be distinct, and $k\in\mathbb N$. The Submodular Multiway Partition problem asks whether $E$ has a partition $(P_1,\ldots,P_r)$ with $t_i\in P_i$ for all $i$ and $\sum_i f(P_i)\le k$. We prove that this problem can be solved in $r^{O(k)}n^{O(1)}$ time whenever $f$ is posimodular. This covers monotone submodular functions, matroid rank functions, and nonnegative combinations of monotone and symmetric submodular functions. When $f$ is a connectivity function, we remove the dependence on the number of terminals and obtain a $k^{O(k)}n^{O(1)}$-time algorithm. The proof is entirely elementary, and is arguably the simplest proof that Edge Multiway Cut is fixed-parameter tractable. As a new consequence, our main result immediately implies that Hypergraph Multiway Partition is fixed-parameter tractable.

cs.DM↗

Combinatorial optimization with bounded subdeterminants

We take a first step toward a broader study of classical combinatorial optimization problems through the maximum subdeterminants of their standard integer programming formulations, yielding new positive results for several famous (NP-hard) problems. An integer matrix is totally $Δ$-modular if every square submatrix has determinant of absolute value at most $Δ$. For every fixed $Δ$, it has been known that maximum clique, maximum stable set, and minimum vertex cover can be solved in polynomial time on instances for which the coefficient matrix of the natural formulation is totally $Δ$-modular. We extend this list by showing that the same holds for many other problems, including the weighted versions of maximum cut, the traveling salesman problem, feedback vertex set, odd cycle transversal, dominating set, max 2-sat, induced matching, and cluster vertex deletion, as well as for $k$-colorability and graph isomorphism. Our proofs reveal several new ways in which bounded subdeterminants impose combinatorial structure: they bound the size or maximum degree of the input graph, bound packings of cycles and other obstructions, or yield decompositions into tractable graph classes such as forests, chordal graphs, graphs of bounded treewidth, and graphs of bounded linear mim-width.

cs.DS↗

Every tournament of dichromatic number $10 k^2$ has a vertex whose out-neighborhood has dichromatic number more than $k$

The dichromatic number of a tournament is the minimum number of colors needed to color the vertices so that no directed cycle is monochromatic. Nguyen, Scott, and Seymour (2025) asked whether every tournament with dichromatic number $2k$ has a vertex whose out-neighborhood induces a subtournament of dichromatic number at least $k$. We answer their question negatively by finding an example with dichromatic number $Ω(k^2)$. Furthermore, this quadratic bound is tight up to a constant factor; we show that for every integer $k \geq 1$, every tournament of dichromatic number $Ω(k^2)$ contains a vertex whose out-neighborhood induces a subtournament of dichromatic number more than $k$. This improves the previous best bound $\mathcal{O}(k^2\log k)$ due to Colinot and Newman (2026). To show this, we prove that every tournament of fractional dichromatic number $c$ has a dominating set of size at most $5c-1$. The proof uses Brouwer's fixed point theorem.

math.CO↗

Formalizing Flag Algebras in Lean

Razborov's flag algebra method is one of the most successful tools for proving asymptotic density inequalities in extremal graph theory. It reduces an inequality about all large graphs avoiding a forbidden pattern to finitely many algebraic conditions, and a certificate satisfying them can be found by semidefinite programming. We formalize the method for finite simple graphs in Lean 4, building on Mathlib. The formalization covers flags and their densities, the flag algebra as a quotient vector space, positive homomorphisms as limits of graph sequences, Razborov's random extensions, and the downward operator that averages out labels. On top of this theory, we build verified computation of flag densities and a tactic that turns certificates found by semidefinite programming into Lean proofs. The certificate serves only as candidate data; Lean checks every fact the proof uses. With this development we verify seven Turán-type upper bounds. Adding lower-bound constructions proved in Lean yields the asymptotic form of Mantel's theorem and the asymptotic Erdős pentagon theorem $π(C_5;K_3)=24/625$; to our knowledge, the latter has not previously been formalized in a proof assistant. We also prove two inequalities of Goodman. All density theorems reported here depend only on the standard axioms of Lean's logic. Formalization also led us to treat forbidden subgraphs with a different semantics. Instead of building a separate flag algebra for each forbidden family, we keep a single algebra of all graphs and impose the constraint only when interpreting an inequality, through randomly labeled limits of graphs satisfying it. We prove that this ensemble semantics yields the intended density bounds, and that a condition we call root-plantability characterizes when it agrees with the standard semantics.

cs.LO↗

Coloring graphs with no long induced path

Let $P_t$ denote the induced path on $t$ vertices. Let $ω(G)$ denote the maximum number of vertices in a clique of a graph $G$. Gyárfás (1987) proved that every $P_t$-free graph $G$ satisfies $χ(G)\le(t-1)^{ω(G)-1}$, and Gravier, Hoàng, and Maffray (2003) improved this to $χ(G)\le (t-2)^{ω(G)-1}$ for $t\ge4$. We lower the base of the exponential by one: for every $t\ge5$, every $P_t$-free graph $G$ satisfies \[ χ(G)\le 3\,(t-3)^{ω(G)+4}. \] The proof combines two refinements of the Gyárfás path argument and was developed with the assistance of Claude Fable 5.1 of Anthropic and GPT Pro of OpenAI.

math.CO↗

On the chromatic number of the union of comparability graphs

Resolving in a strong sense a problem of Gyárfás on the union of two perfect graphs, we prove that for every pair of positive integers $d$ and $k$, there is a graph $G$ with clique number $k$ and chromatic number $k^d$ that is the union of $d$ comparability graphs. We also show that the chromatic number can be replaced by the fractional chromatic number or $\frac{|V(G)|}{α(G)}$.

math.CO↗

A proof of the cycle double cover conjecture by OpenAI: An exposition

The cycle double cover conjecture states that every bridgeless graph has a list of cycles such that every edge is in exactly two of them. In July 2026, OpenAI announced a proof. This exposition presents the proof with slight modifications intended to make it more accessible.

math.CO↗

The Excluded Vertex-Minors and Pivot-Minors for Rank-Width at Most Two

We determine both the excluded vertex-minors and the excluded pivot-minors for the class of graphs of rank-width at most two. Up to local equivalence and graph isomorphism, there are exactly 25 excluded vertex-minors: 1 graph on 8 vertices, 18 on 9 vertices, and 6 on 10 vertices. Up to pivot equivalence and graph isomorphism, there are exactly 609 excluded pivot-minors: 2 on 8 vertices, 447 on 9 vertices, 146 on 10 vertices, 10 on 11 vertices, and 4 on 12 vertices. No excluded vertex-minor occurs on 11--16 vertices, and no excluded pivot-minor occurs on 13--16 vertices; the author's 16-vertex bound makes both lists complete. The proof is computer-assisted. Instead of enumerating all graphs, we reverse the one-vertex reduction theorem for prime graphs. For each $n$, we retain exactly the prime $n$-vertex graphs of rank-width at most two, modulo local equivalence and isomorphism, and extend those graphs by one vertex. Local-equivalence classes are identified by an exact canonical key obtained from the associated isotropic system, the binary row space of $[I\mid A(G)]$. A restricted version of the same key classifies pivot equivalence exactly. The vertex-minor and pivot-minor computations examine, respectively, more than $9.0\times 10^{10}$ and $4.9\times 10^{11}$ prime extensions in their 16-vertex final layers.

math.CO↗

Branch-width of represented matroids in matrix multiplication time

For an $n$-element matroid $M$ given by an $n \times n$ matrix representation over a finite field $\mathbb F$ and an integer $k$, we present an algorithm with running time $O_{k,\mathbb F}(n^2)+O(n^ω)$ that either finds a branch-decomposition of $M$ of width at most $k$, or confirms that the branch-width of $M$ is more than $k$, where $ω< 2.3714$ is the matrix multiplication exponent, and the $O_{k,\mathbb F}(\cdot)$-notation hides factors that depend on $k$ and $\mathbb F$ in a computable manner. All previous algorithms, including Hliněný and Oum [SIAM J. Comput. (2008)] and Jeong, Kim, and Oum [SIAM J. Discrete Math. (2021)], have cubic-time bottlenecks. Moreover, if the input matrix representation is given in standard form, our algorithm runs in $O_{k,\mathbb F}(n^2)$ time, since $O(n^ω)$ time is only needed for finding a standard form of the input matrix. When $M$ is given by an $m \times n$ matrix, the overhead for finding a standard form is $O(mn \min(m,n)^{ω-2})$. As corollaries, we obtain faster algorithms for rank-width of directed graphs and path-width of matroids represented over a fixed finite field. Furthermore, we also present an approximation algorithm for finding branch-width that works on infinite fields provided that the input matrix is in standard form and contains a bounded number of distinct values of entries. To suggest that our algorithm is optimal, we observe that for every field $\mathbb F$, deciding whether the branch-width of a matroid represented over $\mathbb F$ is $0$ is as hard as deciding whether a square matrix over $\mathbb F$ is singular. Under the assumption that singularity testing requires $Ω(n^ω)$-time, this implies that the overhead of $O(n^ω)$ is unavoidable. We also show strengthenings of this observation to rule out some approximations under this assumption.

cs.DS↗

Ramsey-type $χ$-bounds for $χ$-bounded graph classes

We prove that for every path $P$, the class of graphs with no induced $P$ and no induced four-cycle $C_4$ is linearly $χ$-bounded. More generally, we ask for which pairs $\{T,H\}$ where $T$ is a forest and $H$ is a complete multipartite graph, every graph $G$ with no induced $T$ and no induced $H$ has chromatic number at most $C \cdot R(α(H),ω(G)+1)$ for some constant $C$ depending only on $T$ and $H$, where $R(\cdot,\cdot)$ denotes the usual Ramsey numbers. We show that this holds in the following two instances, which strengthen the case $T=P$ and $H=C_4$ mentioned above: (1) every component of $T$ is a broom and $H$ is complete multipartite; or (2) $T$ is a forest and $H$ is complete bipartite. These two unify and substantially extend a number of previous results on linear and polynomial $χ$-boundedness for various graph classes. For case (2), we also provide a new proof (with better bounds) of a recent result of Fox, Nenadov, and Pham on the existence of an induced copy of a fixed tree in a graph satisfying certain sparsity conditions.

math.CO↗

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions

We study connectivity functions, that is, integer-valued symmetric submodular functions on a finite ground set attaining $0$ on the empty set. For a connectivity function $f$ on an $n$-element set $V$ and an integer $k\ge 0$, we show that the family of all sets $X\subseteq V$ with $f(X)=k$ admits a polynomial-size representation: it can be described by a list of at most $O(n^{4k})$ items, each consisting of a set to be included, another set to be excluded, and a partition of remaining elements, such that the union of some members of the partition and the set to be included are precisely all sets $X$ with $f(X)=k$. We also give an algorithm that constructs this representation in time $O(n^{2k+7}γ+n^{2k+8}+n^{4k+2})$, where $γ$ is the oracle time to evaluate $f$. This generalizes the low rank structure theorem of Bojańczyk, Pilipczuk, Przybyszewski, Sokołowski, and Stamoulis [Low rank MSO, arXiv, 2025] on cut-rank functions on graphs to general connectivity functions. As an application, for fixed $k$, we obtain a polynomial-time algorithm for finding a set $A$ with $f(A)=k$ and a prescribed cardinality constraint on $A$.

math.CO↗

Branch-width of connectivity functions is fixed-parameter tractable

A connectivity function on a finite set $V$ is a symmetric submodular function $f \colon 2^V \to \mathbb{Z}$ with $f(\emptyset)=0$. We prove that finding a branch-decomposition of width at most $k$ for a connectivity function given by an oracle is fixed-parameter tractable (FPT), by providing an algorithm of running time $2^{O(k^2)} γn^6 \log n$, where $γ$ is the time to compute $f(X)$ for any set $X$, and $n = |V|$. This improves the previous algorithm by Oum and Seymour [J. Combin. Theory Ser. B, 2007], which runs in time $γn^{O(k)}$. Our algorithm can be applied to rank-width of graphs, branch-width of matroids, branch-width of (hyper)graphs, and carving-width of graphs. This resolves an open problem asked by Hliněný [SIAM J. Comput., 2005], who asked whether branch-width of matroids given by the rank oracle is fixed-parameter tractable. Furthermore, our algorithm improves the best known dependency on $k$ in the running times of FPT algorithms for graph branch-width, rank-width, and carving-width.

cs.DS↗

Reuniting $χ$-boundedness with polynomial $χ$-boundedness

A class $\mathcal{F}$ of graphs is $χ$-bounded if there is a function $f$ such that $χ(H)\le f(ω(H))$ for all induced subgraphs $H$ of a graph in $\mathcal{F}$. If $f$ can be chosen to be a polynomial, we say that $\mathcal{F}$ is polynomially $χ$-bounded. Esperet proposed a conjecture that every $χ$-bounded class of graphs is polynomially $χ$-bounded. This conjecture has been disproved; it has been shown that there are classes of graphs that are $χ$-bounded but not polynomially $χ$-bounded. Nevertheless, inspired by Esperet's conjecture, we introduce Pollyanna classes of graphs. A class $\mathcal{C}$ of graphs is Pollyanna if $\mathcal{C}\cap \mathcal{F}$ is polynomially $χ$-bounded for every $χ$-bounded class $\mathcal{F}$ of graphs. We prove that several classes of graphs are Pollyanna and also present some proper classes of graphs that are not Pollyanna.

math.CO↗

Blind cop-width and balanced minors of graphs

We investigate a pursuit-evasion game on an undirected graph in which a robber, moving at a fixed constant speed, attempts to evade a team of cops who are blind to the robber's location and can quickly travel between any pair of vertices in the graph. The blind cop-width is the minimum number of cops needed to catch the robber on a given graph. We link it with other known graph parameters defined in terms of pursuit-evasion games, and show a new lower bound with respect to treewidth. The proof introduces the notion of balanced minors, where all branch sets of a minor model have equal size.

math.CO↗

Fragile minor-monotone parameters under random edge perturbation

We conduct a quantitative analysis of how many random edges need to be added to a base graph $H$ in order to significantly increase natural minor-monotone graph parameters of the resulting graph $R$. Specifically, we show that if $R$ is obtained from a connected graph $H$ by adding only a few random edges, the tree-width, genus, and Hadwiger number of $R$ become very large, irrespective of the structure of $H$.

math.CO↗

Sharing tea on a graph

Motivated by the analysis of consensus formation in the Deffuant model for social interaction, we consider the following procedure on a graph $G$. Initially, there is one unit of tea at a fixed vertex $r \in V(G)$, and all other vertices have no tea. At any time in the procedure, we can choose a connected subset of vertices $T$ and equalize the amount of tea among vertices in $T$. We prove that if $x \in V(G)$ is at distance $d$ from $r$, then $x$ will have at most $\frac{1}{d+1}$ units of tea during any step of the procedure. This bound is best possible and answers a question of Gantert. We also consider arbitrary initial weight distributions. For every finite graph $G$ and $w \in \mathbb{R}_{\geq 0}^{V(G)}$, we prove that the set of weight distributions reachable from $w$ is a compact subset of $\mathbb{R}_{\geq 0}^{V(G)}$.

math.CO↗

Unavoidable pivot-minors in graphs of large rank-depth

Shrub-depth and rank-depth are related graph parameters that are dense analogs of tree-depth. We prove that for every positive integer $t$, every graph of sufficiently large rank-depth contains a pivot-minor isomorphic to a path on $t$ vertices or a graph consisting of two disjoint cliques of size $t$ joined by a half graph. This answers an open problem raised by Kwon, McCarty, Oum, and Wollan in 2021.

math.CO↗