License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2021.39
URN: urn:nbn:de:0030-drops-147328
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14732/
Go to the corresponding LIPIcs Volume Portal

Iliopoulos, Fotis

Improved Bounds for Coloring Locally Sparse Hypergraphs

pdf-format:
LIPIcs-APPROX39.pdf (0.6 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{iliopoulos:LIPIcs.APPROX/RANDOM.2021.39,
  author =	{Iliopoulos, Fotis},
  title =	{{Improved Bounds for Coloring Locally Sparse Hypergraphs}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)},
  pages =	{39:1--39:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-207-5},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{207},
  editor =	{Wootters, Mary and Sanit\`{a}, Laura},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/14732},
  URN =		{urn:nbn:de:0030-drops-147328},
  doi =		{10.4230/LIPIcs.APPROX/RANDOM.2021.39},
  annote =	{Keywords: hypergaph coloring, semi-random method, locally sparse, random hypergraphs}
}

Keywords: hypergaph coloring, semi-random method, locally sparse, random hypergraphs
Collection: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Issue Date: 2021
Date of publication: 15.09.2021

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI