Principal eigenvectors in hypergraph Turán problems
Throughout this article, the authors work with simple, \(r\)-uniform hypergraphs, and they sometimes restrict it to the case \(r = 3.\)\N\NFor a general class of \(r\)-uniform hypergraph Turán problems, the authors analyze the principal eigenvector corresponding to the \(p\)-spectral radius (as defined by \textit{P. Keevash} et al. [SIAM J. Discrete Math. 28, No. 4, 1838--1854 (2014; Zbl 1309.05121)] and \textit{V. Nikiforov} [Linear Algebra Appl. 432, No. 9, 2243--2256 (2010; Zbl 1217.05152)]) of the extremal hypergraphs. Specifically, they show in a strong sense that these eigenvectors assign nearly equal weights to each vertex -- equivalently, that the principal ratio is close to 1. They further examine the sharpness of this result: it is conjectured to be tight for the Turán tetrahedron problem. In this latter analysis, a lower bound on the \(p\)-spectral radius of an arbitrary \(r\)-graph is established, which is expressed in terms of the hypergraph's degree sequence. This work extends prior results by \textit{K. Cardoso} and \textit{V. Trevisan} [Linear Multilinear Algebra 69, No. 14, 2641--2656 (2021; Zbl 1472.05094)], \textit{H. Li} et al. [Linear Algebra Appl. 544, 273--285 (2018; Zbl 1436.05062)], \textit{S. M. Cioabă} and \textit{D. A. Gregory} [Electron. J. Linear Algebra 16, 366--379 (2007; Zbl 1142.05337)], and \textit{X.-D. Zhang} [Linear Algebra Appl. 409, 79--86 (2005; Zbl 1072.05040)].\N\NFor the case \(1 < p < r\), the results of this paper reveal subtleties tied to Nikiforov's notion of \(k\)-tightness, which arises from the Perron-Frobenius theory for the \(p\)-spectral radius. A conjecture addressing these subtleties is proposed, and the authors provide some preliminary evidence to support this conjecture.
- A bound on the spectral radius of graphs with \(e\) edges
- A class of constructions for Turan's (3,4)-problem
- A contribution to the Zarankiewicz problem
- A new upper bound for the spectral radius of graphs with girth at least 5
- A spectral condition for odd cycles in graphs
- A Spectral Erdős-Sós Theorem
- An Upper Bound on Zarankiewicz' Problem
- Analytic methods for uniform hypergraphs
- Bounds on graph eigenvalues. II
- Eigenvalues of subgraphs of the cube
- Eigenvectors and eigenvalues of non-regular graphs
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 4200246 (Why is no real title available?)
- scientific article; zbMATH DE number 3966110 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- scientific article; zbMATH DE number 3372065 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- Maximum spectral radius of outerplanar 3‐uniform hypergraphs
- More constructions for Turan's (3,4)-conjecture
- On extremal problems of graphs and generalized graphs
- On the second eigenvalue of hypergraphs
- On the spectral radii of graphs without given cycles
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the spectral radius of graphs with a given domination number
- On the spectral radius of graphs with cut vertices
- Principal eigenvectors and spectral radii of uniform hypergraphs
- Principal eigenvectors of general hypergraphs
- Principal eigenvectors of irregular graphs
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- Spectra of uniform hypergraphs
- Spectral bounds for the clique and independence numbers of graphs
- Spectral extrema for graphs: the Zarankiewicz problem
- Spectral extremal problems for hypergraphs
- Spectral extremal results for hypergraphs
- Spectral radius and Hamiltonicity of graphs
- Spectral radius on linear \(r\)-graphs without expanded \(K_{r+1}\)
- The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
- The spectral radius of graphs on surfaces
- The spectral radius of graphs with no odd wheels
- The spectral radius of graphs without paths and cycles of specified length
- The spectral Turán problem about graphs with no 6-cycle
- Upper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphs
This page was built for publication: Principal eigenvectors in hypergraph Turán problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908607)
