Some extremal problems for hereditary properties of graphs

MaRDI QIDQ405091zbMATHFDO

Authors 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

extremal problemslargest eigenvaluehereditary propertyTurán problems

Mathematics Subject Classification ID

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

Abstract: This note answers extremal questions like: what is the maximum number of edges in a graph of order n, which belongs to some hereditary property. The same question is answered also for the spectral radius and other similar parameters.

Recommendations

• scientific article; zbMATH DE number 970795
• Degenerate Turán problems for hereditary properties
• On some variations of extremal graph problems
• The penultimate rate of growth for graph properties
• Extremal problems for the p-spectral radius of graphs

Cites work

• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 3224335 (Why is no real title available?)
• scientific article; zbMATH DE number 3258858 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• scientific article; zbMATH DE number 3298603 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Analytic methods for uniform hypergraphs
• Graphs with many r -cliques have large complete r -partite subgraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On the Structure of Edge Graphs
• On the structure of linear graphs
• Some new results in extremal graph theory
• Spectral extremal problems for hypergraphs

Cited in

(17)

• Strong forms of stability from flag algebra calculations
• The \(f\)-factor problem for graphs and the hereditary property
• Maximal graphs with respect to hereditary properties
• Hereditarily infinite-dimensional property for asymptotic dimension and graphs with large girth
• Degenerate Turán problems for hereditary properties
• Extremal problems for the \(p\)-spectral radius of graphs
• On the jump number problem in hereditary classes of bipartite graphs
• Spectral Turán-type problems on cancellative hypergraphs
• scientific article; zbMATH DE number 1416461 (Why is no real title available?)
• Analytic methods for uniform hypergraphs
• On easy and hard hereditary classes of graphs with respect to the independent set problem
• On spectral theory of a k-uniform directed hypergraph
• The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs
• A jump to the Bell number for hereditary graph properties
• Extremal sets of graphs in the problem of demarcation in the family of hereditary closed classes of graphs
• The extremal \(p\)-spectral radius of Berge hypergraphs
• The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs

This page was built for publication: Some extremal problems for hereditary properties of graphs

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