2026-07-22T08:26:57Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:14732 2024-03-06T10:54:46Z ddc:004 open_access

Improved Bounds for Coloring Locally Sparse Hypergraphs Iliopoulos, Fotis hypergaph coloring semi-random method locally sparse random hypergraphs We show that, for every k ≥ 2, every k-uniform hypergaph of degree Δ and girth at least 5 is efficiently (1+o(1))(k-1) (Δ / ln Δ)^{1/(k-1)}-list colorable. As an application we obtain the currently best deterministic algorithm for list-coloring random hypergraphs of bounded average degree. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Fotis Iliopoulos 2021 Is Part Of LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.APPROX/RANDOM.2021.39 urn:nbn:de:0030-drops-147328 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.39 eng https://creativecommons.org/licenses/by/4.0/legalcode