scientific article; zbMATH DE number 3691361
From MaRDI portal
Publication:3885778
Cited in
(21)- A note on stability for maximal \(F\)-free graphs
- Singular Turán numbers and worm-colorings
- Exact stability for Turán's theorem
- Making Kr+1-free graphs r-partite
- Strong Turán stability
- Strong Turán stability
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
- A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs
- Refinement on Spectral Turán’s Theorem
- Some position problems for graphs
- Some exact results for regular Turán problems for all large orders
- Improving the Caro-Wei bound and applications to Turán stability
- A spectral analogue of Ore's problem on Turán theorem
- Non-r-partite graphs without complete split subgraphs
- Counting multiple graphs in generalized Turán problems
- Spectral extremal problems for non-bipartite graphs without odd cycles
- On some extremal position problems for graphs
- A stability theorem for maximal \(K_{r+1}\)-free graphs
- A problem of Erdős and Hajnal on paths with equal-degree endpoints
- Non-bipartite graphs without theta subgraphs
- Number of copies of \(C_4\) guarantees strong structural stability of graphs forbidding \(C_{2k+1}\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885778)
