Extremal Graphs without Large Forbidden Subgraphs
From MaRDI portal
Publication:4154888
DOI10.1016/S0167-5060(08)70495-3zbMATH Open0375.05034OpenAlexW1987001420WikidataQ105998124 ScholiaQ105998124MaRDI QIDQ4154888FDOQ4154888
Authors: Béla Bollobás, Miklós Simonovits, Endre Szemerédi, P. Erdős 
Publication date: 1978
Published in: Advances in Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70495-3
Recommendations
- Extremal Graphs without Topological Complete Subgraphs
- The number of graphs with large forbidden subgraphs
- Extremal subgraphs for two graphs
- scientific article; zbMATH DE number 3961651
- The number of graphs without forbidden subgraphs
- Extremal subgraphs with respect to vertex degree bounds
- Extremal graph theory and finite forcibility
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- scientific article; zbMATH DE number 147631
- Graphs without large triangle free subgraphs
Cited In (14)
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Testing subgraphs in directed graphs
- The fine structure of octahedron-free graphs
- Extremal graphs without exponentially small bicliques
- The number of graphs without forbidden subgraphs
- Compactness results in extremal graph theory
- Title not available (Why is that?)
- A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
- On graphs with small subgraphs of large chromatic number
- Subdivisions of transitive tournaments
- Generating all subsets of a finite set with disjoint unions
- Extremal graphs having no stable cutset
- Title not available (Why is that?)
This page was built for publication: Extremal Graphs without Large Forbidden Subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154888)
