Author:
Conlon David,Fox Jacob,Grinshpun Andrey,He Xiaoyu
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. M. Ajtai, J. Komlós and E. Szemerédi, A note on Ramsey numbers, J. Combin. Theory Ser. A 29 (1980), 354–360.
2. N. Alon, On the number of subgraphs of prescribed type of graphs with a given number of edges, Israel J. Math 38 (1981), 116–130.
3. N. Alon and J. H. Spencer, The Probabilistic Method, 3rd ed., Wiley, 2008.
4. J. Beck, Achievement games and the probabilistic method, in Combinatorics, Paul Erdős is Eighty, Vol. 1, 51–78, Bolyai Soc. Math. Stud., János Bolyai Math. Soc., Budapest, 1993.
5. J. Beck, Combinatorial Games: Tic-Tac-Toe Theory, Cambridge University Press, 2008.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bounds on Ramsey games via alterations;Journal of Graph Theory;2023-05-08
2. On the subgraph query problem;Combinatorics, Probability and Computing;2020-07-27
3. Ramsey, Paper, Scissors;Random Structures & Algorithms;2020-07-20
4. Finding cliques using few probes;Random Structures & Algorithms;2019-10-22