The prototype of such results is Turán's theorem, where there is one forbidden subgraph: a complete graph with k vertices (k is fixed).
Graph of a function | graph | Bipartite graph | topological space | planar graph | graph theory | directed graph | Under Graph | random graph | Planar graph | Graph traversal | Graph theory | Graph (mathematics) | Gabriel graph | visibility graph | Unit distance graph | Topological quantum field theory | topological quantum field theory | Topological insulator | rook's graph | Rado graph | minor (graph theory) | Lattice graph | interval graph | Graph-tool | Graph (data structure) | Graph coloring | graph coloring | Graph | Factor graph |