Name
Abstract | ||
|---|---|---|
In this paper we introduce a unifying approach to the generalized Turan problem and supersaturation results in graph theory. The supersaturation-extremal function satex(n, F : m, G) is the least number of copies of a subgraph G an n-vertex graph can have, which contains at least m copies of F as a subgraph. We present a survey, discuss previously known results and obtain several new ones focusing mainly on proof methods, extrernal structure and phase transition phenomena. Finally we point out some relation with extrernal questions concerning hypergraphs, particularly Berge-type results. (C) 2021 The Authors. Published by Elsevier B.V. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.disc.2021.112743 | DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
Extremal combinatorics, Generalized Turan problems, Supersaturation problems | Journal | 345 |
Issue | ISSN | Citations |
3 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dániel Gerbner | 1 | 46 | 21.61 |
| Zoltán Lóránt Nagy | 2 | 0 | 0.34 |
| Máté Vizer | 3 | 27 | 14.06 |