Strong forms of stability from flag algebra calculations
Authors:
- Oleg PikhurkoOPOleg Pikhurko
- Jakub SliačanJSJakub Sliačan
- Konstantinos TyrosKTKonstantinos Tyros
- 1 March 2019
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 135, 129-178
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- H2020 European Research Council (306493)
- Engineering and Physical Sciences Research Council (EP/K012045/1)
- H2020 European Research Council (306493)
This publication has 29 references indexed in Scilit:
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycleEuropean Journal of Combinatorics, 2016
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularityJournal of Combinatorial Theory, Series B, 2015
- Measurable events indexed by products of treesCombinatorica, 2014
- A problem of Erdős on the minimum number of k -cliquesJournal of Combinatorial Theory, Series B, 2013
- Efficient Testing of Large GraphsCombinatorica, 2000
- The maximal number of inducedr-partite subgraphsGraphs and Combinatorics, 1995
- The inducibility of complete bipartite graphsJournal of Graph Theory, 1994
- The maximal number of induced complete bipartite graphsDiscrete Mathematics, 1986
- Supersaturated graphs and hypergraphsCombinatorica, 1983
- On a theorem of Rademacher-TuránIllinois Journal of Mathematics, 1962