Let $r\ge 3$ and $k\ge 2r+1$ be fixed integers. We determine, for all sufficiently large $n$, the maximum adjacency-tensor spectral radius of an $n$-vertex $r$-uniform hypergraph containing no Berge cycle of length at least $k$. Write $s=\left\lfloor\frac{k-1}{2}\right\rfloor$. If $k=2s+1$ is odd, the unique extremal hypergraph consists of all $r$-sets containing at most one vertex outside a fixed $s$-set. If $k=2s+2$ is even, one additionally includes all $r$-sets containing a fixed pair outside the $s$-set together with $r-2$ vertices inside it. Consequently, the maximum spectral radius is given as \[ \operatorname{spex}_r(n,k) = \left[ \binom{s}{r-1} \left(\frac{r-1}{s}\right)^{(r-1)/r} +o(1) \right]n^{(r-1)/r}. \]
For every fixed $r\ge3$ and all sufficiently large $n$, we determine the largest adjacency spectral radius of an $n$-vertex graph with fewer than $q c_r(n)$ copies of $K_{r+1}$, where $1\le q<n/r$. Here $c_r(n)$ is the number of copies created by adding one edge to a largest part of the Tur\'an graph. We also determine...
For a $k$-uniform hypergraph $\mathcal H$, the shadow of $\mathcal H$ is the graph whose edges are the pairs covered by a hyperedge. In this paper, for all sufficiently large $n$, we determine the $n$-vertex $k$-uniform hypergraphs of maximum adjacency-tensor spectral radius whose shadow has no $K_t$ minor, for every $...
For a fixed integer $k\ge 2$, let $kK_3$ denote the vertex-disjoint union of $k$ triangles. A recent fixed-size spectral theorem of Das and Yamini asserts that, for all sufficiently large $m$, every $kK_3$-free graph $G$ of size $m$ satisfies $\lambda(G)\le (k-1)+\sqrt{m-k(k-1)},$ and equality holds if and only if $(2k...
Let $k\ge 3$ and let $n=km$. A $K_k$-factor in an $n$-vertex graph is a collection of $m$ vertex-disjoint copies of $K_k$ that covers the entire vertex set. We determine the maximum adjacency spectral radius of an $n$-vertex graph containing no $K_k$-factor when $m\ge 2k-1$. More precisely, we prove that every such gra...
In 1977, Erd\H{o}s posed the problem of determining the maximum number $f_r(n)$ of edges in an $n$-vertex $r$-uniform hypergraph in which all disjoint pairs of edges have distinct unions. F\"uredi later conjectured that, for every fixed $r\ge 4$ and all sufficiently large $n$, $f_r(n)=\binom{n-1}{r-1}+\lfloor \frac{n-1...
Hao-Wei Huang, Jie Ma, Tian-Chi Yang· 2 citations· ⚡1
Let $\mathcal P_1$ denote the class of 1-planar graphs and let $tC_5$ be the disjoint union of $t$ copies of $C_5$. For every fixed $t\ge3$ and all sufficiently large $n$, we determine the unique $n$-vertex $tC_5$-free graph in $\mathcal P_1$ with maximum adjacency spectral radius, answering Problem 1 of Li, Wang and Z...
Zhan-He Zhang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.