Kang, Mihyun, Makai, Tamás and Pikhurko, Oleg (2020) Supersaturation problem for the bowtie. European Journal of Combinatorics, 88 . 103107. doi:10.1016/j.ejc.2020.103107

Preview

PDF WRAP-supersaturation-problem-bowtie-Pikhurko-2019.pdf - Accepted Version - Requires a PDF viewer. Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0. Download (799Kb) | Preview

Request Changes to record.

Abstract

The Turán function denotes the maximal number of edges in an -free graph on vertices. We consider the function , the minimal number of copies of in a graph on vertices with edges. The value of has been extensively studied when is bipartite or colour-critical. In this paper we investigate the simplest remaining graph , namely, two triangles sharing a vertex, and establish the asymptotic value of for .

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, Combinatorial analysis
Journal or Publication Title:	European Journal of Combinatorics
Publisher:	Academic Press
ISSN:	0195-6698
Official Date:	August 2020
Dates:	Date Event August 2020 Published 31 March 2020 Available 18 April 2019 Accepted
Volume:	88
Article Number:	103107
DOI:	10.1016/j.ejc.2020.103107
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
RIOXX Funder/Project Grant:	Project/Grant ID RIOXX Funder Name Funder ID P26826 Austrian Science Fund http://dx.doi.org/10.13039/501100002428 306493 European Research Council http://dx.doi.org/10.13039/501100000781 EP/K012045/1 [EPSRC] Engineering and Physical Sciences Research Council http://dx.doi.org/10.13039/501100000266
Related URLs:	Publisher

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads