Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties

Abstract For fixed graphs F 1 ,…, F r , we prove an upper bound on the threshold function for the property that G ( n , p ) → ( F 1 ,…, F r ). This establishes the 1-statement of a conjecture of Kohayakawa and Kreuter.

Saved in:
Bibliographic Details
Published inCombinatorics, probability & computing Vol. 29; no. 6; pp. 943 - 955
Main Authors Mousset, Frank, Nenadov, Rajko, Samotij, Wojciech
Format Journal Article
LanguageEnglish
Published Cambridge Cambridge University Press 01.11.2020
Subjects
Combinatorics
Graphs
Upper bounds
Online AccessGet full text

Cover

More Information
Summary:Abstract For fixed graphs F 1 ,…, F r , we prove an upper bound on the threshold function for the property that G ( n , p ) → ( F 1 ,…, F r ). This establishes the 1-statement of a conjecture of Kohayakawa and Kreuter.
ISSN:0963-5483
1469-2163
DOI:10.1017/S0963548320000267