English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Recently, Davies, Jenssen, Perkins, and Roberts gave a very nice proof of theresult (due, in various parts, to Kahn, Galvin-Tetali, and Zhao) that theindependence polynomial of a $d$-regular graph is maximized by disjoint copiesof $K_{d,d}$. Their proof uses linear programming bounds on the distribution ofa cleverly chosen random variable. In this paper, we use this method to givelower bounds on the independence polynomial of regular graphs. We also give newbounds on the number of independent sets in triangle-free regular graphs.

Minimizing the number of independent sets in triangle-free regular graphs