Analytic methods for uniform hypergraphs

DOI10.1016/j.laa.2014.05.005zbMath1291.05142arXiv1308.1654MaRDI QIDQ2250784

Vladimir Nikiforov

Publication date: 21 July 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.1654

zbMATH Keywords

eigenvalues; extremal problems; largest eigenvalue; spectral methods; uniform hypergraphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C65: Hypergraphs

Related Items

The maximum spectral radius ofk-uniform hypergraphs withrpendent vertices, On the first and second eigenvalue of finite and infinite uniform hypergraphs, Unnamed Item, The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs, The p-spectral radius of the Laplacian matrix, On the spectral radii and principal eigenvectors of uniform hypergraphs, The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs, Some properties of the p-spectral radius on tensors for general hypergraphs and their applications, On the irregularity of uniform hypergraphs, Spectral extremal graphs for the bowtie, Refinement on Spectral Turán’s Theorem, Some bounds on the spectral radius of uniform hypergraphs, Minimizing the distance spectral radius of uniform hypertrees with given parameters, The high order spectrum of a graph and its applications in graph colouring and clique counting, Comparing the principal eigenvector of a hypergraph and its shadows, On spectral theory of a k-uniform directed hypergraph, The \(H\)-spectra of a class of generalized power hypergraphs, Connected hypergraphs with small spectral radius, On the principal eigenvectors of uniform hypergraphs, Some extremal problems for hereditary properties of graphs, Extremal problems for the \(p\)-spectral radius of graphs, Hypergraphs and hypermatrices with symmetric spectrum, Principal eigenvectors and spectral radii of uniform hypergraphs, Some properties and applications of odd-colorable \(r\)-hypergraphs, Bounds on the spectral radius of uniform hypergraphs, Computing the \(p\)-spectral radii of uniform hypergraphs with applications, On the irregularity of uniform hypergraphs, Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees, The matching polynomials and spectral radii of uniform supertrees, The spectrum of a class of uniform hypergraphs, Extremal problems for the \(p\)-spectral radius of Berge hypergraphs, Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs, The extremal \(p\)-spectral radius of Berge hypergraphs, The \(\alpha\)-normal labeling for generalized directed uniform hypergraphs, The principal eigenvector to \(\alpha\)-spectral radius of hypergraphs, The stabilizing index and cyclic index of the coalescence and Cartesian product of uniform hypergraphs, The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number, Adjacency spectra of random and complete hypergraphs, The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs, Combinatorial methods for the spectral \(p\)-norm of hypermatrices, Some properties of the Laplace and normalized Laplace spectra of uniform hypergraphs, The eigenvectors to the \(p\)-spectral radius of general hypergraphs, On extremal spectral radius of blow-up uniform hypergraphs, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some extremal problems for hereditary properties of graphs
• Spectra of uniform hypergraphs
• On spectral hypergraph theory of the adjacency tensor
• Spektren endlicher Grafen
• Lower bounds for the clique and the chromatic numbers of a graph
• Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs
• Spectral bounds for the clique and independence numbers of graphs
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• On the second eigenvalue of hypergraphs
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• On maximal entries in the principal eigenvector of graphs
• The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
• The Turán number of the Fano plane
• On extremal problems of graphs and generalized graphs
• Eigenvalues of a real supersymmetric tensor
• Rank and eigenvalues of a supersymmetric tensor, the multivariate homogeneous polynomial and the algebraic hypersurface it defines
• A spectral condition for odd cycles in graphs
• Hypergraph regularity and the multidimensional Szemerédi theorem
• The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory
• Complete Partite subgraphs in dense hypergraphs
• Some Inequalities for the Largest Eigenvalue of a Graph
• Spectral Radius and Degree Sequence
• Matrix Analysis
• Regularity Lemma for k-uniform hypergraphs
• Spectral Extremal Problems for Hypergraphs
• The counting lemma for regular k‐uniform hypergraphs
• The Eigenvalues of a Graph and Its Chromatic Number
• An inequality for the chromatic number of a graph
• Triple Systems Not Containing a Fano Configuration