{
  "abstract": "For every fixed $k\\ge2$, we give a randomized one-pass insertion-only algorithm that colors an $n$-vertex $k$-uniform hypergraph of maximum degree $Δ$ with $O(Δ^{1/(k-1)})$ colors using $\\widetilde O_k(n)$ bits of working memory. As a graph-theoretic result of independent interest, we also prove a tight palette-sparsification theorem for general uniform hypergraphs. Independently sampled lists of $Θ(\\sqrt{\\log n})$ colors from a palette of size $O(Δ^{1/(k-1)})$ preserve colorability with high probability; the list-size dependence is asymptotically optimal. These results extend to bounded-rank hypergraphs. We complement the algorithm with a deterministic lower bound: for every fixed polylogarithmic semi-streaming space bound, there are polylogarithmic values of $Δ$ for which any deterministic one-pass algorithm requires $\\exp(Δ^{Ω(1)})$ colors.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2608.19623",
  "author_total": 4,
  "authors": [
    {
      "name": "Artur Czumaj"
    },
    {
      "name": "Pan Peng"
    },
    {
      "name": "Ruizhe Shi"
    },
    {
      "name": "Christian Sohler"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/37vf4828sqgpe.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2608.19623",
  "fulltext_url": null,
  "id": "37vf4828sqgpe",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2608.19623",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.DM"
    ],
    [
      "arxiv",
      "cs.DS"
    ],
    [
      "arxiv",
      "math.CO"
    ],
    [
      "openalex",
      "1703|Complexity and Algorithms in Graphs"
    ]
  ],
  "openalex": "W7203935931",
  "pdf_url": "https://arxiv.org/pdf/2608.19623",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-17",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/37vf4828sqgpe.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:22:23Z",
      "native_id": "2608.19623",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2608.19623"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Streaming Hypergraph Coloring via Palette Sparsification",
  "title_text": "Streaming Hypergraph Coloring via Palette Sparsification",
  "type": "preprint",
  "updated_at": "2026-10-30T12:22:23Z",
  "url": "https://research.draconitic.com/paper/37vf4828sqgpe",
  "venue": "arXiv",
  "versions": []
}