A Short Proof of Kahn-Kalai Conjecture

Phuc Tran, Van Vu
{"title":"A Short Proof of Kahn-Kalai Conjecture","authors":"Phuc Tran, Van Vu","doi":"10.37236/12266","DOIUrl":null,"url":null,"abstract":"In a recent paper, Park and Pham famously proved Kahn-Kalai conjecture. In this note, we simplify their proof, using an induction to replace the original analysis. This reduces the proof to one page and from the argument it is also easy to read that one can set the constant $K$ in the conjecture to $\\approx 3.998$, which could be the best value under the current method. Our argument also applies to the $\\epsilon$-version of the Park-Pham result, studied by Bell.","PeriodicalId":509530,"journal":{"name":"The Electronic Journal of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Electronic Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37236/12266","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In a recent paper, Park and Pham famously proved Kahn-Kalai conjecture. In this note, we simplify their proof, using an induction to replace the original analysis. This reduces the proof to one page and from the argument it is also easy to read that one can set the constant $K$ in the conjecture to $\approx 3.998$, which could be the best value under the current method. Our argument also applies to the $\epsilon$-version of the Park-Pham result, studied by Bell.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
卡恩-卡莱猜想的简短证明
在最近的一篇论文中,Park 和 Pham 著名地证明了 Kahn-Kalai 猜想。在本注释中,我们简化了他们的证明,用归纳法取代了原来的分析。这将证明缩减为一页,从论证中也很容易读出,我们可以将猜想中的常数 $K$ 设为 $\approx3.998$,这可能是当前方法下的最佳值。我们的论证也适用于贝尔研究的帕克-帕姆结果的 $\epsilon$ 版本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Short Proof of Kahn-Kalai Conjecture Hamiltonian Intervals in the Lattice of Binary Paths Nordhaus-Gaddum Type Inequalities for the $k$th Largest Laplacian Eigenvalues A Nearly Finitary Matroid that is not $k$-Nearly Finitary A Strengthening and an Efficient Implementation of Alon-Tarsi List Coloring Method
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1