The p-spectral radius of k-partite and k-chromatic uniform hypergraphs

DOI10.1016/J.LAA.2015.03.016zbMATH Open1312.05098arXiv1402.0442OpenAlexW2963913851MaRDI QIDQ2347469FDOQ2347469

Authors: Yanyan Li 

Publication date: 27 May 2015

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

Abstract: We characterize the r-graph with maximal p-spectral radius among the k-partite r-graphs of order n, and the 3-graph with maximal p-spectral radius among the k-chromatic 3-graphs of order n.

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

Recommendations

• Extremal problems for the \(p\)-spectral radius of graphs
• Extremal problems for the \(p\)-spectral radius of Berge hypergraphs
• The extremal \(p\)-spectral radius of Berge hypergraphs
• The maximum spectral radius ofk-uniform hypergraphs withrpendent vertices
• The eigenvectors to the \(p\)-spectral radius of general hypergraphs

zbMATH Keywords

uniform hypergraph\(p\)-spectral radius\(k\)-chromatic hypergraph\(k\)-partite hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites Work

• Title not available (Why is that?)
• Analytic methods for uniform hypergraphs
• Title not available (Why is that?)
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Title not available (Why is that?)
• Lower bounds for the clique and the chromatic numbers of a graph
• Spectral extremal problems for hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some extremal problems for hereditary properties of graphs
• Spectral radii of graphs with given chromatic number
• Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs

Cited In (18)

• On the first and second eigenvalue of finite and infinite uniform hypergraphs
• The matching polynomials and spectral radii of uniform supertrees
• Extremal problems for the \(p\)-spectral radius of graphs
• An SDP relaxation method for Perron pairs of a nonnegative tensor
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• Comparing the principal eigenvector of a hypergraph and its shadows
• The Fiedler vector of a Laplacian tensor for hypergraph partitioning
• Spectral radius and matching number of the unicyclic hypergraph
• The high order spectrum of a graph and its applications in graph colouring and clique counting
• Refinement on Spectral Turán’s Theorem
• Extremal problems for the \(p\)-spectral radius of Berge hypergraphs
• Analytic methods for uniform hypergraphs
• On extremal spectral radius of blow-up uniform hypergraphs
• The extremal \(p\)-spectral radius of Berge hypergraphs
• On spectral theory of a k-uniform directed hypergraph
• Spectral extremal graphs for the bowtie
• Ordering of some uniform supertrees with larger spectral radii
• A refined bound for the Z1-spectral radius of tensors

This page was built for publication: The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs

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