Spectral extremal results for hypergraphs
From MaRDI portal
Abstract: Let be a graph. A hypergraph is called Berge if it can be obtained by replacing each edge in by a hyperedge containing it. Given a family of graphs , we say that a hypergraph is Berge -free if for every , the hypergraph does not contain a Berge as a subhypergraph. In this paper we investigate the connections between spectral radius of the adjacency tensor and structural properties of a linear hypergraph. In particular, we obtain a spectral version of Tur'{a}n-type problems over linear -uniform hypergraphs by using spectral methods, including a tight result on Berge -free linear -uniform hypergraphs.
Recommendations
- Spectral extremal problems for hypergraphs
- Spectra of hypergraphs and applications
- Extremal properties of the distance spectral radius of hypergraphs
- On the spectrum of hypergraphs
- Some new results and problems in spectral extremal graph theory
- Spectral properties of general hypergraphs
- scientific article; zbMATH DE number 7352045
- The extremal \(p\)-spectral radius of Berge hypergraphs
- Spectra of general hypergraphs
- On the spectrum and linear programming bound for hypergraphs
Cites work
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 3505014 (Why is no real title available?)
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- A bound on the spectral radius of graphs with \(e\) edges
- A bound on the spectral radius of hypergraphs with \(e\) edges
- A new generalization of Mantel's theorem to \(k\)-graphs
- A survey of Turán problems for expansions
- Almost disjoint triangles in 3-space
- An extension of Mantel's theorem to k-graphs
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Bounds on graph eigenvalues. II
- Eigenvalues of a real supersymmetric tensor
- Extremal results for Berge hypergraphs
- Further results for Perron-Frobenius theorem for nonnegative tensors
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- On 3-uniform hypergraphs without a cycle of a given length
- On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
- On hypergraphs of girth five
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Perron-Frobenius theorem for nonnegative tensors
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Some new results in extremal graph theory
- 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
- The history of degenerate (bipartite) extremal graph problems
Cited in
(20)- Spectral radius on linear \(r\)-graphs without expanded \(K_{r+1}\)
- Graph partitioning: an updated survey
- Spectral bipartite Turán problems on linear hypergraphs
- On the spectral radius of uniform weighted hypergraph
- Spectral extrema for graphs: the Zarankiewicz problem
- A stability result for Berge-\( K_{3 , t}r\)-graphs and its applications
- Extremal problems for the \(p\)-spectral radius of Berge hypergraphs
- Analytic methods for uniform hypergraphs
- MT-product of tensors, spectral radius and walks of hypergraphs
- Spectral Turán problems for nondegenerate hypergraphs
- The extremal \(p\)-spectral radius of Berge hypergraphs
- Spectral extremal graphs for the bowtie
- On the spectral Turán problems for bipartite hypergraphs
- The extremal problems for the spectral radius of hypergraphs without the Berge-graphs
- The spectral radius of the hypergraphs without the expansion of P₃ or Berge-P_k
- Spectral extremal problems for hypergraphs
- Principal eigenvectors in hypergraph Turán problems
- Extremal spectral radii of uniform supertrees
- A note on stability results for Berge-\( K_{s , t}\) hypergraphs
- The spectral radius of 3-graphs without Berge paths of given length
This page was built for publication: Spectral extremal results for hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2049621)