Counting Hypergraph Colorings in the Local Lemma Regime
Work
Year: 2019
Type: article
Abstract: We give a fully polynomial-time approximation scheme (FPTAS) to count the number of $q$-colorings for $k$-uniform hypergraphs with maximum degree $\Delta$ if $k\ge 28$ and $q > 357 \Delta^{\frac{14}{k... more
Source: SIAM Journal on Computing
Authors Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
Cites: 28
Cited by: 17
Related to: 10
FWCI: 2.543
Citation percentile (by year/subfield): 79.39
Subfield: Statistics and Probability
Field: Mathematics
Domain: Physical Sciences
Open Access status: green