Author:
Bucić Matija,Draganić Nemanja,Sudakov Benny,Tran Tuan
Publisher
Springer International Publishing
Reference38 articles.
1. Bucić, M., Draganić, N., Sudakov, B.: Universal and unavoidable graphs. Comb. Probab. Comput. (2021). https://doi.org/10.1017/S0963548321000110
2. Bucić, M., Draganić, N., Sudakov, B.: Universal and unavoidable graphs. arXiv preprint arXiv:1912.04889 (submitted)
3. Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. Proceedings of 30th STOC, pp. 63–68 (1998)
4. Chung, F.R.K.: Unavoidable stars in $$3$$-graphs. J. Combin. Theory Ser. A 35(3), 252–262 (1983)
5. Chung, F.R.K.: Open problems of Paul Erdős in graph theory. J. Graph Theory 25(1), 3–36 (1997)