Author:
Mousset Frank,Nenadov Rajko,Samotij Wojciech
Abstract
AbstractFor fixed graphs F1,…,Fr, we prove an upper bound on the threshold function for the property that G(n, p) → (F1,…,Fr). This establishes the 1-statement of a conjecture of Kohayakawa and Kreuter.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the use of senders for asymmetric tuples of cliques in Ramsey theory;Journal of Combinatorial Theory, Series B;2024-11
2. Ramsey Equivalence for Asymmetric Pairs of Graphs;SIAM Journal on Discrete Mathematics;2024-01-04
3. An asymmetric random Rado theorem: 1-statement;Journal of Combinatorial Theory, Series A;2023-01
4. A resolution of the Kohayakawa--Kreuter conjecture for the majority of cases;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
5. Ramsey goodness of trees in random graphs;Random Structures & Algorithms;2022-11-09