Induced subgraphs of given sizes

We say (n, e) (m, f), an (m, f) subgraph is forced, if every n-vertex graph of size e has an m-vertex spanned subgraph with f edges. For example, as Tur

• Type: Journal
• Year: 1999
• Where: DM
• Authors: Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós
• Keywords: DM 1999, Extremal Graph Theory, M-vertex Spanned Subgraph, N-vertex Graph