Forbidden Subgraph Problems
Forbidden Subgraph Problems is a category of extremal graph theory problems that seek to determine the maximum number of edges in a graph of a given order that does not contain a specified subgraph as a forbidden configuration.
245
Publications
9.1K
Citations
423
Authors
269
Institutions
Publications per year
2017–2026
32
Variants
Turán-type Problems
Parents
245
On an extremal problem in graph theory
Péter L. Erdős · Colloquium Mathematicum · 1964 · 676 citations · Full text
On extremal problems of graphs and generalized graphs
P. Erdös · Israel Journal of Mathematics · 1964 · 449 citations
Extremal problems in graph theory
Christopher M. Hartman · 1997 · 238 citations
1–5 of 245
423
11
h-index
7
h-index
6
h-index
6
h-index
6
h-index
1–5 of 423
269

University of Johannesburg
Johannesburg, South Africa
11 h-index
21 publications
486 citations
University of Bergen
Bergen, Norway
9 h-index
10 publications
436 citations
University of Memphis
Memphis, United States
9 h-index
14 publications
246 citations

Hungarian Academy of Sciences
Budapest, Hungary
8 h-index
12 publications
667 citations

Eötvös Loránd University
Budapest, Hungary
8 h-index
9 publications
915 citations

University of KwaZulu-Natal
Durban, South Africa
7 h-index
8 publications
187 citations
University of West Bohemia in Pilsen
Pilsen, Czechia
7 h-index
12 publications
254 citations
Charles University
Prague, Czechia
7 h-index
9 publications
196 citations
1–8 of 269
50 publications · 1.5K citations
24
h-index
31 publications · 941 citations
19
h-index
22 publications · 776 citations
14
h-index
15 publications · 668 citations
12
h-index
10 publications · 384 citations
10
h-index
1–5