Bo Dong

Bounds on the Spectral Radii of Berge $C_5$-Free Linear $r$-Graphs

An $r$-uniform hypergraph (or $r$-graph) is called linear if any two edges intersect in at most one vertex. For a graph $F=\bigl(V(F),E(F)\bigr)$ and a hypergraph $\mathcal{B}=\bigl(V(\mathcal{B}),E(\mathcal{B})\bigr)$, $\mathcal{B}$ is called a Berge $F$ if there exists a bijection $\phi:E(F)\to E(\mathcal{B})$ such t...