Sampling list packings

DOI10.4230/LIPICS.ITCS.2025.24MaRDI QIDQ7296657zbMATH OpenFDO

Authors Evan Camrud, Ewan Davies, Alex Karduna, Holden Lee

Publication date 14 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2025.24

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A deterministic algorithm for counting colorings with 2 colors
• A more rapidly mixing Markov chain for graph colorings
• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
• Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
• Asymmetric list sizes in bipartite graphs
• Flexible list colorings: maximizing the number of requests satisfied
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 1342087 (Why is no real title available?)
• scientific article; zbMATH DE number 1775385 (Why is no real title available?)
• scientific article; zbMATH DE number 1885142 (Why is no real title available?)
• Improved bounds for perfect sampling of k-colorings in graphs
• Improved bounds for randomly sampling colorings via linear programming
• Improved bounds for sampling colorings
• Improved FPTAS for multi-spin systems
• Independent coverings and orthogonal colourings
• List packing number of bounded degree graphs
• On representatives of subsets.
• On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs
• Packing list‐colorings
• Path coupling: a technique for proving rapid mixing in Markov chains
• Perfectly sampling k ≥ (8/3 + o (1))Δ-colorings in graphs
• Random generation of combinatorial structures from a uniform distribution

Cited in

(1)

• Fractional list packing for layered graphs

This page was built for publication: Sampling list packings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296657)