Analytic methods for uniform hypergraphs

DOI10.1016/J.LAA.2014.05.005zbMATH Open1291.05142arXiv1308.1654OpenAlexW2964193560MaRDI QIDQ2250784FDOQ2250784

Authors: Vladimir Nikiforov 

Publication date: 21 July 2014

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

Abstract: This paper develops analityc methods for investigating uniform hypergraphs. Its starting point is the spectral theory of 2-graphs, in particular, the largest and the smallest eigenvalues of 2-graphs. On the one hand, this simple setup is extended to weighted r-graphs, and on the other, the eigenvalues-numbers are generalized to eigenvalues-functions, which encompass also other graph parameters like Lagrangians and number of edges. The resulting theory is new even for 2-graphs, where well-settled topics become challenges again. The paper covers a multitude of topics, with more than a hundred concrete statements to underpin an analytic theory for hypergraphs. Essential among these topics are a Perron-Frobenius type theory and methods for extremal hypergraph problems. Many open problems are raised and directions for possible further research are outlined.

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

Recommendations

• Spectra of uniform hypergraphs
• Spectral extremal problems for hypergraphs
• Spectral extremal results for hypergraphs
• Analytic connectivity of \(k\)-uniform hypergraphs
• The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs

zbMATH Keywords

eigenvaluesextremal problemslargest eigenvaluespectral methodsuniform hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cites Work

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

Cited In (49)

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

This page was built for publication: Analytic methods for uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250784)