# Quasi-polynomial Algorithms for List-coloring of Nearly Intersecting Hypergraphs

## TL;DR

This paper presents quasi-polynomial algorithms for determining list-colorability in nearly-intersecting hypergraphs, a class where edges mostly intersect, extending efficient coloring checks to complex hypergraph structures.

## Contribution

The authors develop the first quasi-polynomial time algorithms for list-colorability in nearly-intersecting hypergraphs with constant-sized color lists.

## Key findings

- List-colorability can be checked in quasi-polynomial time for nearly-intersecting hypergraphs.
- The approach applies to hypergraphs with edges intersecting all but polylogarithmically many others.
- The algorithms work for color lists of constant size.

## Abstract

A hypergraph $\mathcal{H}$ on $n$ vertices and $m$ edges is said to be {\it nearly-intersecting} if every edge of $\mathcal{H}$ intersects all but at most polylogarthmically many (in $m$ and $n$) other edges. Given lists of colors $\mathcal{L}(v)$, for each vertex $v\in V$, $\mathcal{H}$ is said to be $\mathcal{L}$-(list) colorable, if each vertex can be assigned a color from its list such that no edge in $\mathcal{H}$ is monochromatic. We show that list-colorability for any nearly intersecting hypergraph, and lists drawn from a set of constant size, can be checked in quasi-polynomial time in $m$ and $n$.