Alon和Spencer的一个packing猜想的反证
Disproof of a packing conjecture of Alon and Spencer
摘要:
阿隆和斯宾塞在1992年的一个猜想中粗略地说,普通的随机图$G_{n,1/2}$通常允许它的边的一个常数部分被边不相交的、几乎最大的团覆盖。我们表明,这是不是这样的。反证是基于对一个更基本问题的某种(部分)理解:对于从$\{1\dots n\}$的$k$ -子集中一致且独立地选择的$k\ll \sqrt{n}$和$A_1\dots A_t$,我们可以对\[ \mathbb{P}(|A_i\cap A_j|\leq 1 ~\forall i\neq j)? \]说些什么呢?我们主要关心的是试图理解这个问题和一个关于匹配的相关问题的答案在多大程度上遵循通过假设某些(依赖的)选择是独立做出的逻辑学。
英文摘要:
A 1992 conjecture of Alon and Spencer says, roughly, that the ordinary random graph $G_{n,1/2}$ typically admits a covering of a constant fraction of its edges by edge-disjoint, nearly maximum cliques. We show that this is not the case. The disproof is based on some (partial) understanding of a more basic question: for $k\ll \sqrt{n}$ and $A_1\dots A_t$ chosen uniformly and independently from the $k$-subsets of $\{1\dots n\}$, what can one say about \[ \mathbb{P}(|A_i\cap A_j|\leq 1 ~\forall i\neq j)? \] Our main concern is trying to understand how closely the answers to this and a related question about matchings follow heuristics gotten by pretending that certain (dependent) choices are made independently.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。