Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Journals
  3. Combinatorics, Probability and Computing
  4. Open access articles
Journal Home
Refine listing

Refine listing

Publication date:

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

Open access

Contents

Page 6 of 6

Paper

  • Asymptotic Structure of Graphs with the Minimum Number of Triangles

  • Part of:
  • OLEG PIKHURKO, ALEXANDER RAZBOROV
  • Published online by Cambridge University Press:
    04 May 2016, pp. 138-160
    • Article
      • You have access
      • Open access
    • PDF
    • Export citation

  • We consider the problem of minimizing the number of triangles in a graph of given order and size, and describe the asymptotic structure of extremal graphs. This is achieved by characterizing the set of flag algebra homomorphisms that minimize the triangle density.

Page 6 of 6