Abstract:Let $H$ be a 3-partite 3-uniform hypergraph whose three vertex classes all have size $n$. For a vertex $v \in V(H)$, the link graph $N_H(v)$ is defined on $V(H)\setminus\{v\}$ with edge set $\{e\setminus\{v\}: v\in e\in E(H)\}$, and we denote by $\rho(N_H(v))$ its spectral radius. We prove that for every $\alpha>0$ there exists $n_0$ such that for all $n\ge n_0$ the following holds: if \[ \rho\bigl(N_H(v)\bigr) > \left(\frac{\sqrt{2}}{2}+\alpha\right)n \] for every vertex $v\in V(H)$, then $H$ contains a perfect matching. This spectral condition is asymptotically best possible.
From: Feihong Yuan [view email]
[v1]
Sun, 14 Jun 2026 12:11:01 UTC (16 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。