The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
From MaRDI portal
Publication:2347469
DOI10.1016/j.laa.2015.03.016zbMath1312.05098arXiv1402.0442OpenAlexW2963913851MaRDI QIDQ2347469
Publication date: 27 May 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.0442
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items (17)
Extremal problems for the \(p\)-spectral radius of Berge hypergraphs ⋮ Spectral extremal graphs for the bowtie ⋮ Extremal problems for the \(p\)-spectral radius of graphs ⋮ Refinement on Spectral Turán’s Theorem ⋮ The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning ⋮ 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 ⋮ On extremal spectral radius of blow-up uniform hypergraphs ⋮ Spectral radius and matching number of the unicyclic hypergraph ⋮ On the first and second eigenvalue of finite and infinite uniform hypergraphs ⋮ Computing the \(p\)-spectral radii of uniform hypergraphs with applications ⋮ The matching polynomials and spectral radii of uniform supertrees ⋮ Analytic methods for uniform hypergraphs ⋮ Ordering of some uniform supertrees with larger spectral radii ⋮ A refined bound for the Z1-spectral radius of tensors ⋮ An SDP relaxation method for Perron pairs of a nonnegative tensor
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some extremal problems for hereditary properties of graphs
- Lower bounds for the clique and the chromatic numbers of a graph
- Spectral radii of graphs with given chromatic number
- Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs
- Analytic methods for uniform hypergraphs
- Spectral Extremal Problems for Hypergraphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
This page was built for publication: The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs