Analytic methods for uniform hypergraphs
From MaRDI portal
Publication:2250784
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 3425628 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- A spectral condition for odd cycles in graphs
- An inequality for the chromatic number of a graph
- Complete partite subgraphs in dense hypergraphs
- Eigenvalues of a real supersymmetric tensor
- Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Lower bounds for the clique and the chromatic numbers of a graph
- Matrix Analysis
- On extremal problems of graphs and generalized graphs
- On maximal entries in the principal eigenvector of graphs
- On spectral hypergraph theory of the adjacency tensor
- 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
- Rank and eigenvalues of a supersymmetric tensor, the multivariate homogeneous polynomial and the algebraic hypersurface it defines
- Regularity Lemma for k-uniform hypergraphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- Some extremal problems for hereditary properties of graphs
- Spectra of uniform hypergraphs
- Spectral Radius and Degree Sequence
- Spectral bounds for the clique and independence numbers of graphs
- Spectral extremal problems for hypergraphs
- Spektren endlicher Grafen
- The Eigenvalues of a Graph and Its Chromatic Number
- The Turán number of the Fano plane
- The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
- The counting lemma for regular k‐uniform hypergraphs
- Triple Systems Not Containing a Fano Configuration
Cited in
(48)- Principal eigenvectors and spectral radii of uniform hypergraphs
- The \(p\)-spectral radius of the Laplacian matrix
- Some bounds on the spectral radius of uniform hypergraphs
- The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number
- The spectrum of a class of uniform hypergraphs
- Minimizing the distance spectral radius of uniform hypertrees with given parameters
- Bounds on the spectral radius of uniform hypergraphs
- On ABC spectral radius of uniform hypergraphs
- Some properties and applications of odd-colorable \(r\)-hypergraphs
- The high order spectrum of a graph and its applications in graph colouring and clique counting
- The \(\alpha\)-normal labeling for generalized directed uniform hypergraphs
- On the first and second eigenvalue of finite and infinite uniform hypergraphs
- Non-uniform hypergraphs
- Connected hypergraphs with small spectral radius
- The matching polynomials and spectral radii of uniform supertrees
- Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
- Extremal problems for the \(p\)-spectral radius of graphs
- Some extremal problems for hereditary properties of graphs
- The principal eigenvector to \(\alpha\)-spectral radius of hypergraphs
- The eigenvectors to the \(p\)-spectral radius of general hypergraphs
- Spectral Turán-type problems on cancellative hypergraphs
- Extremal problems for the \(p\)-spectral radius of Berge hypergraphs
- Some properties of the p-spectral radius on tensors for general hypergraphs and their applications
- Some properties of the Laplace and normalized Laplace spectra of uniform hypergraphs
- The maximum spectral radius ofk-uniform hypergraphs withrpendent vertices
- Comparing the principal eigenvector of a hypergraph and its shadows
- Adjacency spectra of random and complete hypergraphs
- On spectral theory of a k-uniform directed hypergraph
- The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs
- The stabilizing index and cyclic index of the coalescence and Cartesian product of uniform hypergraphs
- Refinement on Spectral Turán’s Theorem
- Extremal properties of the distance spectral radius of hypergraphs
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- Lower bounds for the Laplacian spectral radius of an oriented hypergraph
- Analytic connectivity of \(k\)-uniform hypergraphs
- On the principal eigenvectors of uniform hypergraphs
- Spectral extremal graphs for the bowtie
- Combinatorial methods for the spectral \(p\)-norm of hypermatrices
- Hypergraphs and hypermatrices with symmetric spectrum
- Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs
- The \(H\)-spectra of a class of generalized power hypergraphs
- On the spectral radii and principal eigenvectors of uniform hypergraphs
- On the irregularity of uniform hypergraphs
- On extremal spectral radius of blow-up uniform hypergraphs
- The extremal \(p\)-spectral radius of Berge hypergraphs
- The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs
- On the irregularity of uniform hypergraphs
- The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic 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)
