通过能量(Energy)方法研究超图中的大割
Large Cuts in Hypergraphs via Energy
AI总结:
本研究结合概率、组合、线性代数及半定规划方法,改进了r≥3时r-均匀超图(含线性超图)的r-部子超图边数下界,并建立了图能量与最大割的新关系,改进了已有结果。
摘要:
一个简单的概率论证表明,每个含m条边的r-均匀超图都包含一个r-部子超图,其边数至少为$\frac{r!}{r^r}m$。Edwards的著名结果指出,在图的情形即r=2时,得到的m/2界可以改进为m/2+Ω(m^{1/2}),且该结果是紧的。我们证明,当r≥3时,存在一个r-部子超图,其边数至少为$\frac{r!}{r^r} m+m^{3/5-o(1)}$。此外,若超图是线性的,该界可改进为$\frac{r!}{r^r} m+m^{3/4-o(1)}$,这在忽略o(1)项的意义下是紧的。这些结果改进了Conlon、Fox、Kwan和Sudakov的成果。我们的证明结合了概率方法、组合方法、线性代数技术以及半定规划。\n论证的一个关键部分是将图G的能量$\boldsymbol{\text{(即邻接矩阵特征值的绝对值之和)}}$与其最大割联系起来。我们证明,每个含m条边的多重图G都存在一个大小至少为$m/2+Ω(\frac{\text{(G)}}{\text{log}m})$的割,该结果可能具有独立研究价值。
英文摘要:
A simple probabilistic argument shows that every $r$-uniform hypergraph with $m$ edges contains an $r$-partite subhypergraph with at least $\frac{r!}{r^r}m$ edges. The celebrated result of Edwards states that in the case of graphs, that is $r=2$, the resulting bound $m/2$ can be improved to $m/2+Ω(m^{1/2})$, and this is sharp. We prove that if $r\geq 3$, then there is an $r$-partite subhypergraph with at least $\frac{r!}{r^r} m+m^{3/5-o(1)}$ edges. Moreover, if the hypergraph is linear, this can be improved to $\frac{r!}{r^r} m+m^{3/4-o(1)},$ which is tight up to the $o(1)$ term. These improve results of Conlon, Fox, Kwan, and Sudakov. Our proof is based on a combination of probabilistic, combinatorial, and linear algebraic techniques, and semidefinite programming. A key part of our argument is relating the energy $\mathcal{E}(G)$ of a graph $G$ (i.e. the sum of absolute values of eigenvalues of the adjacency matrix) to its maximum cut. We prove that every $m$ edge multigraph $G$ has a cut of size at least $m/2+Ω(\frac{\mathcal{E}(G)}{\log m})$, which might be of independent interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。