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

Authors

423

  1. MA
    Michael A. Henning

    University of Johannesburg, South Africa

    12 publications · 226 citations

    11

    h-index

  2. RJ
    Ralph J. Faudree

    University of Memphis, United States

    7 publications · 119 citations

    7

    h-index

  3. ZR
    Zdeněk Ryjáček

    University of West Bohemia in Pilsen, Czechia

    6 publications · 148 citations

    6

    h-index

  4. MS
    Miklós Simonovits

    Hungarian Academy of Sciences, Hungary

    6 publications · 333 citations

    6

    h-index

  5. RJ
    Ronald J. Gould

    Emory University, United States

    6 publications · 131 citations

    6

    h-index

1–5 of 423

Venues

  1. Discrete Mathematics

    50 publications · 1.5K citations

    24

    h-index

  2. Discrete Applied Mathematics

    31 publications · 941 citations

    19

    h-index

  3. Journal of Graph Theory

    22 publications · 776 citations

    14

    h-index

  4. Journal of Combinatorial Theory Series B

    15 publications · 668 citations

    12

    h-index

  5. Graphs and Combinatorics

    10 publications · 384 citations

    10

    h-index

1–5