Some extremal problems for hereditary properties of graphs

zbMath1300.05144arXiv1305.1072MaRDI QIDQ405091

Vladimir Nikiforov

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

extremal problemslargest eigenvaluehereditary propertyTurán problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items

Degenerate Turán problems for hereditary properties ⋮ The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs ⋮ Extremal problems for the \(p\)-spectral radius of graphs ⋮ On spectral theory of a k-uniform directed hypergraph ⋮ The extremal \(p\)-spectral radius of Berge hypergraphs ⋮ Analytic methods for uniform hypergraphs ⋮ The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analytic methods for uniform hypergraphs
• Some new results in extremal graph theory
• On the Structure of Edge Graphs
• Spectral Extremal Problems for Hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Graphs with many r -cliques have large complete r -partite subgraphs
• On the structure of linear graphs