Journal title
Israel Journal of Mathematics
DOI
10.1007/s11856-020-2034-8
Volume
238
Last updated
2023-12-19T05:14:23.443+00:00
Page
639-661
Abstract
<p>Let <em>G</em> be a graph, and let <em>f</em><sub><em>G</em></sub> be the sum of (−1)<sup>∣<em>A</em>∣</sup>, over all stable sets <em>A.</em> If <em>G</em> is a cycle with length divisible by three, then <em>f</em><sub><em>G</em></sub> = ±2. Motivated by topological considerations, G. Kalai and R. Meshulam [8] made the conjecture that, if no induced cycle of a graph <em>G</em> has length divisible by three, then ∣<em>f</em><sub><em>G</em></sub>∣ ≤ 1. We prove this conjecture.</p>
Symplectic ID
1070385
Submitted to ORA
On
Favourite
Off
Publication type
Journal Article
Publication date
07 Jul 2020