Triangle-free subgraphs of random graphs

Allen, Peter, Böttcher, Julia, Kohayakawa, Yoshiharu and Roberts, Barnaby (2016) Triangle-free subgraphs of random graphs. Combinatorics, Probability and Computing . ISSN 0963-5483 (In Press)

PDF - Accepted Version Restricted to Repository staff only Download (386Kb)

• LSE expert's profile
• LSE expert's profile

Abstract

Recently there has been much interest in studying random graph analogues of well known classical results in extremal graph theory. Here we follow this trend and investigate the structure of triangle-free subgraphs of G(n, p) with high minimum degree. We prove that asymptotically almost surely each triangle-free spanning subgraph of G(n, p) with minimum degree at least ( 2 + o(1)lpn is O(p−1 n)-close to bipartite, and each spanning triangle-free subgraph of G(n, p) with minimum degree at least ( 1 + ε)pn is O(p−1 n)-close to r-partite for some r = r(ε). These are random graph analogues of a result by Andrásfai, Erdős and Sós [Discrete Math. 8 (1974), 205–218], and a result by Thomassen [Combinatorica 22 (2002), 591–596]. We also show that our results are best possible up to a constant factor.

Item Type:	Article
Official URL:	http://journals.cambridge.org/action/displayJourna...
Additional Information:	© 2016 Cambridge University Press
Library of Congress subject classification:	Q Science > QA Mathematics
Sets:	Departments > Mathematics
Project and Funder Information:	Project ID Funder Name Funder ID 013/03447-6 FAPESP UNSPECIFIED 2013/07699-0 FAPESP UNSPECIFIED 477203/2012-4 CNPq UNSPECIFIED 310974/2013-5 CNPq UNSPECIFIED 459335/2014-6 CNPq UNSPECIFIED DMS 1102086 NSF UNSPECIFIED MaCLinC/USP NUMEC/USP UNSPECIFIED
Date Deposited:	23 Jun 2016 09:58
URL:	http://eprints.lse.ac.uk/66985/

Actions (login required)

Record administration - authorised staff only