Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Strong forms of stability from flag algebra calculations

Tools
- Tools
+ Tools

Pikhurko, Oleg, Sliačan, Jakub and Tyros, Konstantinos (2019) Strong forms of stability from flag algebra calculations. Journal of Combinatorial Theory Series B, 135 . pp. 129-178. doi:10.1016/j.jctb.2018.08.001

[img]
Preview
PDF
WRAP-strong-forms-stability-flag-algebra-Pikhurko-2018.pdf - Accepted Version - Requires a PDF viewer.
Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0.

Download (929Kb) | Preview
Official URL: https://doi.org/10.1016/j.jctb.2018.08.001

Request Changes to record.

Abstract

Given a hereditary family G of admissible graphs and a function λ ( G ) that linearly depends on the statistics of order- κ subgraphs in a graph G , we consider the extremal problem of determining λ ( n, G ), the maximum of λ ( G ) over all admissible graphs G of order n . We call the problem perfectly B -stable for a graph B if there is a constant C such that every admissible graph G of order n ≥ C can be made into a blow-up of B by changing at most C ( λ ( n, G ) − λ ( G )) ( n 2 ) adjacencies. As special cases, this property describes all almost extremal graphs of order n within o ( n 2 ) edges and shows that every extremal graph of order n ≥ n 0 is a blow-up of B . We develop general methods for establishing stability-type results from flag algebra computations and apply them to concrete examples. In fact, one of our sufficient conditions for perfect stability is stated in a way that allows automatic verification by a computer. This gives a unifying way to obtain computer-assisted proofs of many new results.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science > Mathematics
Library of Congress Subject Headings (LCSH): Combinatorial number theory, Algebra
Journal or Publication Title: Journal of Combinatorial Theory Series B
Publisher: Elsevier
ISSN: 0095-8956
Official Date: March 2019
Dates:
DateEvent
March 2019Published
13 August 2018Available
3 August 2018Accepted
Volume: 135
Page Range: pp. 129-178
DOI: 10.1016/j.jctb.2018.08.001
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
306493European Research Councilhttp://viaf.org/viaf/130022607
EP/K012045/1[EPSRC] Engineering and Physical Sciences Research Councilhttp://dx.doi.org/10.13039/501100000266
Related URLs:
  • Publisher
Open Access Version:
  • ArXiv

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us