Proof of the Kalai-Meshulam conjecture
dc.contributor.author | Chudnovsky, Maria | |
dc.contributor.author | Scott, Alex | |
dc.contributor.author | Seymour, Paul | |
dc.contributor.author | Spirkl, Sophie | |
dc.date.accessioned | 2022-08-12T00:33:06Z | |
dc.date.available | 2022-08-12T00:33:06Z | |
dc.date.issued | 2020-07-01 | |
dc.description | This is a post-peer-review, pre-copyedit version of an article published in Israel Journal of Mathematics. The final authenticated version is available online at: https://doi.org/10.1007/s11856-020-2034-8 | en |
dc.description.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 ∣fG∣ ≤ 1. We prove this conjecture. | en |
dc.description.sponsorship | Supported by NSF Grant DMS-1763817. This material is based upon work supported in part by the U.S. Army Research Laboratory and the U.S. Army Research Office under grant number W911NF-16-1-0404. || Supported by a Leverhulme Trust Research Fellowship. || Supported by ONR grant N00014-14-1-0084 and NSF grant DMS-1265563. | en |
dc.identifier.uri | https://doi.org/10.1007/s11856-020-2034-8 | |
dc.identifier.uri | http://hdl.handle.net/10012/18516 | |
dc.language.iso | en | en |
dc.publisher | Springer Nature | en |
dc.subject | proof | en |
dc.subject | Kalai-Meshulam conjecture | en |
dc.title | Proof of the Kalai-Meshulam conjecture | en |
dc.type | Article | en |
dcterms.bibliographicCitation | Chudnovsky, M., Scott, A., Seymour, P. et al. Proof of the Kalai-Meshulam conjecture. Isr. J. Math. 238, 639–661 (2020). https://doi.org/10.1007/s11856-020-2034-8 | en |
uws.contributor.affiliation1 | Faculty of Mathematics | en |
uws.contributor.affiliation2 | Combinatorics and Optimization | en |
uws.peerReviewStatus | Reviewed | en |
uws.scholarLevel | Faculty | en |
uws.typeOfResource | Text | en |