ex(n, K_3, (t+1)F_k) equals a specific construction-based quantity for all n, t, k, with the extremal graphs being a blow-up or modified complete bipartite graph plus triangles.
Erd˝ os, Some recent results on extremal problems in graph theory, in: Results, Theory of Graphs, International Symposium, Rome, 1966, 1967, pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The maximum number of triangles in graphs without vertex disjoint friendship graphs
ex(n, K_3, (t+1)F_k) equals a specific construction-based quantity for all n, t, k, with the extremal graphs being a blow-up or modified complete bipartite graph plus triangles.