Pikhurko, Oleg and Razborov, Alexander (2017) Asymptotic structure of graphs with the minimum number of triangles. Combinatorics, Probability and Computing, 26 (1). pp. 138-160. doi:10.1017/S0963548316000110 ISSN 0963-5483.

Preview	PDF WRAP_CPC-S0963548316000110a.pdf - Published Version - Requires a PDF viewer. Available under License Creative Commons Attribution 4.0. Download (745Kb) | Preview
	PDF Asymptotic Structure.pdf - Submitted Version Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer. Download (284Kb)

Request Changes to record.

Abstract

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.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics
Divisions:	Faculty of Science, Engineering and Medicine > Science > Mathematics
Library of Congress Subject Headings (LCSH):	Graph theory
Journal or Publication Title:	Combinatorics, Probability and Computing
Publisher:	Cambridge University Press
ISSN:	0963-5483
Official Date:	January 2017
Dates:	Date Event January 2017 Published 4 May 2016 Available 24 September 2014 Submitted
Volume:	26
Number:	1
Number of Pages:	23
Page Range:	pp. 138-160
DOI:	10.1017/S0963548316000110
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Open Access (Creative Commons)
Date of first compliant deposit:	2 June 2016
Date of first compliant Open Access:	6 June 2016
Funder:	European Research Council (ERC), Engineering and Physical Sciences Research Council (EPSRC)
Grant number:	306493 (ERC), EP/K012045/1 (EPSRC)

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads