Triangle-free subgraphs of random graphs

Allen, Peter, Böttcher, Julia, Roberts, Barnaby and Kohayakawa, Yoshiharu (2015) Triangle-free subgraphs of random graphs. In: European Conference on Combinatorics, Graph Theory and Applications, 31 Aug - 04 Sep, Bergen, Norway. (Unpublished)

Preview

PDF Download (258Kb) | Preview

• LSE expert's profile
• LSE expert's profile
• Published Item

Abstract

The Andrásfai-Erdős-Sós Theorem [2] states that all triangle-free graphs on n vertices with minimum degree strictly greater than 2n/5 are bipartite. Thomassen [11] proved that when the minimum degree condition is relaxed to ( 1 3 + ε)n, the result is still guaranteed to be rε-partite, where rε does not depend on n. We prove best possible random graph analogues of these theorems.

Item Type:	Conference or Workshop Item (Paper)
Official URL:	https://eurocomb2015.b.uib.no/
Additional Information:	© 2015 The Authors
Library of Congress subject classification:	Q Science > QA Mathematics
Sets:	Departments > Mathematics
Date Deposited:	09 Dec 2015 15:06
URL:	http://eprints.lse.ac.uk/64640/

Actions (login required)

Record administration - authorised staff only