✦ LIBER ✦

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

✍ Scribed by C. Greenhill

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independent sets in random sparse graphs

✍ Pedro G. Gazmuri 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

Counting Hexagonal Patches and Independe

✍ Paul Bonsma; Felix Breuer 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 912 KB

The Resolution Complexity of Independent

✍ Paul Beame; Russell Impagliazzo; Ashish Sabharwal 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 486 KB

Subhypergraph counts in extremal and ran

✍ Andrzej Dudek; Joanna Polcyn; Andrzej Ruciński 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 417 KB

Colourings of the cartesian product of g

✍ Attila Pór; David R. Wood 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 551 KB

On the Number of Edges in Colour-Critica

✍ A. V. Kostochka; M. Stiebitz 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 189 KB