Some extremal problems for hereditary properties of graphs
zbMATH Open1300.05144arXiv1305.1072MaRDI QIDQ405091FDOQ405091
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
extremal problemslargest eigenvaluehereditary property[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Tur%EF%BF%BD%EF%BF%BDn+problems&go=Go Tur��n problems]
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the structure of linear graphs
- 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?)
- Some new results in extremal graph theory
- On the Structure of Edge Graphs
- Title not available (Why is that?)
- Spectral Extremal Problems for Hypergraphs
- Graphs with many r -cliques have large complete r -partite subgraphs
Cited In (16)
- On the jump number problem in hereditary classes of bipartite graphs
- Extremal problems for the \(p\)-spectral radius of graphs
- Title not available (Why is that?)
- Spectral Turán-type problems on cancellative hypergraphs
- Hereditarily infinite-dimensional property for asymptotic dimension and graphs with large girth
- Degenerate Turán problems for hereditary properties
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- Analytic methods for uniform hypergraphs
- 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
- On spectral theory of a k-uniform directed hypergraph
- A jump to the Bell number for hereditary graph properties
- The \(f\)-factor problem for graphs and the hereditary property
- The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs
- Maximal graphs with respect to hereditary properties
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)