k-ColoringはChromatic Numberの計算よりも高速である
k-Coloring is Faster than Computing the Chromatic Number (arxiv.org)
要約
この論文は、固定されたkに対して、n頂点グラフのk-Coloring問題が(2-εk)^n時間で解けるランダム化アルゴリズムが存在することを証明しています。これは、k≤6の場合を除き、これまで知られていたよりも高速な解法です。著者は、既存のリスト彩色還元技術とハイパーグラフコンテナベースのアプローチを組み合わせ、新しいリスト彩色アルゴリズムを導入することで、この長年の未解決問題を解決しました。
全文翻訳
Computer Science > Data Structures and Algorithms
arXiv:2607.25973 (cs)
[Submitted on 28 Jul 2026 (v1), last revised 9 Sep 2026 (this version, v2) ]
Title:k-Coloring は Chromatic Number の計算よりも高速である
Authors:Or Zamir
View a PDF of the paper titled k-Coloring is Faster than Computing the Chromatic Number, by Or Zamir
Abstract:We prove that $k$-coloring on $n$-vertex graphs has a randomized algorithm running in time $(2-\varepsilon_k)^n$, where $\varepsilon_k>0$ for every fixed $k$. Previously, only the cases $k\leq 6$ were known to have faster solutions than the general $O^\star\bigl(2^n\bigr)$ time algorithm of [Björklund, Husfeldt, Koivisto, SICOMP 2009] that computes the chromatic number. In fact, our algorithm solves the more general problem of $k$-list-coloring, even when the overall color palette is of unbounded size.
We resolve this long-standing open problem by generalizing and combining tools from the $(k+2)$-coloring to $k$-list-coloring reduction of [Zamir, ICALP 2021] and the hypergraph-containers based approach in [Zamir, STOC 2023] . Together with new algorithms for list-coloring instances mixing long and short color lists, this yields an iterable reduction from $(k+1)$-list-coloring to $k$-list-coloring over arbitrary palettes.
| Comments: | This revision includes a generalization from k-list-coloring with bounded overall palette size, to an unbounded palette size |
| Subjects: | Data Structures and Algorithms (cs.DS) |
| Cite as: | arXiv:2607.25973 [cs.DS] |
| (or arXiv:2607.25973v2 [cs.DS] for this version) | |
| https://doi.org/10.48550/arXiv.2607.25973 arXiv-issued DOI via DataCite |
Submission history
From: Or Zamir view email
v1 Tue, 28 Jul 2026 16:53:58 UTC (47 KB)
[v2] Wed, 9 Sep 2026 14:31:56 UTC (46 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled k-Coloring is Faster than Computing the Chromatic Number, by Or Zamir
[画像: license icon] view license
Additional Features
Current browse context:
cs.DS
Change to browse by:
References & Citations
Loading...
BibTeX formatted citation
loading...
Data provided by:
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
- Author
- Venue
- Institution
- Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)