Journal article icon

Journal article

Proof of the Kalai-Meshulam conjecture

Abstract:

Let G be a graph, and let fG be the sum of (−1)A, over all stable sets A. If G is a cycle with length divisible by three, then fG = ±2. Motivated by topological considerations, G. Kalai and R. Meshulam [8] made the conjecture that, if no induced cycle of a graph G has length divisible by three, then ∣

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1007/s11856-020-2034-8

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Oxford college:
Merton College
Role:
Author
ORCID:
0000-0003-4489-5988
More from this funder
Name:
Leverhulme Trust
Grant:
RF-2017-093\9
Publisher:
Springer
Journal:
Israel Journal of Mathematics More from this journal
Volume:
238
Pages:
639-661
Publication date:
2020-07-07
Acceptance date:
2019-07-25
DOI:
EISSN:
1565-8511
ISSN:
0021-2172
Language:
English
Keywords:
Pubs id:
pubs:1070385
UUID:
uuid:f68f6941-dcc6-4b37-975d-d218c5aa34af
Local pid:
pubs:1070385
Source identifiers:
1070385
Deposit date:
2019-11-07

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP