Extremal Graphs without Large Forbidden Subgraphs
From MaRDI portal
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
(17)- On graphs with small subgraphs of large chromatic number
- Subdivisions of transitive tournaments
- The number of graphs without forbidden subgraphs
- Compactness results in extremal graph theory
- Extremal graphs having no stable cutset
- A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 3941574 (Why is no real title available?)
- scientific article; zbMATH DE number 3655979 (Why is no real title available?)
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- Testing subgraphs in directed graphs
- The fine structure of octahedron-free graphs
- Generating all subsets of a finite set with disjoint unions
- Extremal graphs without exponentially small bicliques
- Testing graph properties with the container method
- Ramsey numbers of small wheels versus fans
- An efficient asymmetric removal lemma and its limitations
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)
