Proof of the Kalai-Meshulam conjecture
<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> ...
Main Authors: | , , , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Springer
2020
|