Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.24644

Improved Space Bounds for Promise Graph Coloring in Adversarial Streams

Sergio Thoumi
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study promise graph coloring in one pass insertion-only adversarial streams. We give a randomized algorithm that distinguishes 3-colorable graphs from graphs that are not 6-colorable using $O(n^{3/2}\log(n/\varepsilon)\log n)$ bits of space. This provides a truly subquadratic space algorithm for a constant coloring gap, answering an open problem posed by Assadi, Sundaresan, and Yazdanyar [SODA 2026] for $q=3$. Combining this algorithm with the vertex-sampling lemma of Assadi et al.\ yields, for any $144\lceil\log_2 n\rceil\le Q\le n$, a one-pass decision algorithm distinguishing $3$-colorable graphs from graphs that are not $Q$-colorable using $O((n/Q)^{3/2}\log^5 n)$ bits of space. This improves upon the $\widetilde{O}((n/Q)^2)$ bound achievable via dynamic streaming techniques. Setting $Q=\lceil n^{1/3}\rceil$ yields a semi-streaming decision algorithm, answering the decision version of another open problem posed by Assadi et al. On the negative side, we prove that distinguishing $χ(G)\le q$ from $χ(G)\ge(q-1)^2$ requires $Ω(n^2/q^5)$ bits of space, improving upon the previously established $q^2/4$ threshold using the same space complexity.

Explore related subjects

cs.DScs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergio Thoumi. 2026-10-17. Improved Space Bounds for Promise Graph Coloring in Adversarial Streams. https://arxiv.org/abs/2610.24644

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Improved exploration of temporal graphs

A temporal graph $G$ is a sequence $(G_t)_{t \in I}$ of graphs on the same vertex set of size $n$. The \emph{temporal exploration problem} asks for the length of the shortest sequence of vertices that starts at a given vertex, visits every vertex, and at each time step $t$ either stays at the current vertex or moves to an adjacent vertex in $G_t$. When each $G_t$ is connected and has bounded maximum degree, Erlebach, Kammer, Luo, Sajenko, and Spooner [ICALP 2019] showed that an exploration exists in $\mathcal{O}(n^{7/4})$ time steps. We significantly improve this bound by showing that $\mathcal{O}(n^{3/2}\sqrt{\log n})$ time steps suffice. In fact, we prove a more general statement unifying this setting with many others. Let the \emph{average temporal maximum degree} $D$ of $G$ be the average of $\max_{t \in I}d_{G_t}(v)$ over all vertices $v \in V(G)$, where $d_{G_t}(v)$ denotes the degree of $v$ in $G_t$. We show that if each $G_t$ is connected, then an exploration exists in $\mathcal{O}(n^{3/2}\sqrt{D\log n})$ time steps. This gives the first subquadratic upper bound when the underlying graph has bounded average degree, improving the previous best bounds when it is planar or has bounded treewidth. Our bound is subquadratic already when $D=o(n/\log n)$. In addition, we make progress on a recent conjecture of Baguley, Göbel, Klodt, Skretas, Sylvester, and Zamaraev [SODA 2025]. They conjectured that if $μ$ is a probability distribution on trees with maximum degree at most $Δ$ and each $G_t$ is sampled independently from $μ$, then an exploration exists in $\mathcal{O}(\sqrtΔn)$ time steps with high probability. We show that there is a temporal exploration of length $\mathcal{O}(Δn\log^3 n)$ with high probability. This improves the previous best bound of $\mathcal{O}(n^{3/2})$ and extends to the more general setup of average temporal maximum degree.

cs.DS↗
arXiv2026

A Constructive FPT Algorithm for Integer Cone Optimization with Convex Costs

We give a deterministic fixed-parameter algorithm for integer cone optimization with convex costs. Given $τ$ rational polytopes in $\mathbb{R}^d$, each with a convex cost function, we minimize the total cost of nonnegative integer combinations of their lattice points subject to arbitrary rational linear constraints on the typewise aggregates and generator counts. Our algorithm runs in time \[ 2^{τ\log(τ+1)\,2^{O(d)}}\cdot |I|^{O(1)}, \] where $|I|$ is the total binary input length. It constructs an optimal representation using at most $2^{2d+1}$ distinct generators per type. For a single generator type, the running time becomes $2^{2^{O(d)}}\cdot |I|^{O(1)}$. This yields constructive FPT algorithms for Cone and Polytope Intersection and high-multiplicity bin packing, improving the $2^{2^{O(d\log d)}}\cdot |I|^{O(1)}$ bound of Koana and Kumabe (2026) for bin-packing decision. The dependence on $d$ is ETH-tight for point-in-cone, high-multiplicity bin packing, and vector bin packing. For vector bin packing, this establishes fixed-parameter tractability in the number of item types. We also obtain new FPT parameterizations for high-multiplicity scheduling on uniform and unrelated machines: makespan minimization and $\ell_q$-load minimization are FPT in the number of job and machine types.

cs.DS↗
arXiv2026

Output-linear time enumeration of potential maximal cliques

First defined by Bouchitté and Todinca, Potential Maximal Cliques (PMC) are a well studied notion in graph theory due to its numerous applications. The PMCs of an undirected graph $G$ are defined as the maximal cliques of the minimal triangulations of $G$. Their number can be exponential in the size of the graph. PMCs were crucial in the design of a polynomial-time algorithm which solves Maximum Weight Independent Set on $P_6$-free graphs (Grzesik, Klimošová, Pilipczuk, Pilipczuk, 2020). They also play a central role in the proposal of a polynomial-time algorithm to solve Largest Induced Subgraph of treewidth $\le t$ (Fomin, Todinca, Villanger, 2013). Last but not least, certainly one of the main application of PMCs is the existence of an exact dynamic-programming algorithm to determine the treewidth of a graph (Fomin, Kratsch, Todinca, Villanger, 2008) which uses its list of PMCs as an input. In fact, the enumeration of PMCs stands as the bottleneck for the computation of treewidth with this method: the PMC-enumeration step takes output-quadratic time (Bouchitté, Todinca, 2002) while the dynamic-programming one takes a time linear in the number of PMCs. This two-step procedure was proven to be among the most performing approaches in practice to determine treewidth. Answering a longstanding open question, we propose an algorithm to enumerate PMCs in output-linear time, i.e. a running time linear in the number of PMCs. This offers nice perspectives not only from the theoretical viewpoint - better running time for the PMC-based methods determining treewidth, for Minimum Fill-In and Largest Induced Subgraph of treewidth $\le t$ - but also from the practical side, with the possibility to propose top-performance implementation.

cs.DS↗