Robust algorithms for the secretary problem D Bradac, A Gupta, S Singla, G Zuzic
arXiv preprint arXiv:1911.07352, 2019
25 2019 Powers of Hamilton cycles of high discrepancy are unavoidable D Bradač
Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021
13 2021 (Near) optimal adaptivity gaps for stochastic multi-value probing D Bradac, S Singla, G Zuzic
arXiv preprint arXiv:1902.01461, 2019
12 2019 The Turán number of the grid D Bradač, O Janzer, B Sudakov, I Tomon
Bulletin of the London Mathematical Society 55 (1), 194-204, 2023
7 2023 Minimum Degree Threshold for D Bradač, M Christoph, L Gishboliner
arXiv preprint arXiv:2302.13780, 2023
6 2023 Weighted Turán theorems with applications to Ramsey-Turán type of problems J Balogh, D Bradač, B Lidicky
Copyright 2023, The Authors, 2023
6 2023 Large cliques or cocliques in hypergraphs with forbidden order-size pairs M Axenovich, D Bradač, L Gishboliner, D Mubayi, L Weber
Combinatorics, Probability and Computing 33 (3), 286-299, 2024
4 2024 The extremal number of cycles with all diagonals D Bradač, A Methuku, B Sudakov
International Mathematics Research Notices 2024 (12), 9728-9742, 2024
3 2024 Effective bounds for induced size-Ramsey numbers of cycles D Bradač, N Draganić, B Sudakov
Combinatorica, 1-29, 2024
3 2024 Asymptotics of the hypergraph bipartite Turán problem D Bradač, L Gishboliner, O Janzer, B Sudakov
Combinatorica 43 (3), 429-446, 2023
3 2023 Covering random graphs with monochromatic trees D Bradač, M Bucić
Random Structures & Algorithms 62 (3), 545-563, 2023
3 2023 Turán numbers of sunflowers D Bradač, M Bucić, B Sudakov
Proceedings of the American Mathematical Society 151 (03), 961-975, 2023
3 2023 A generalization of Tur\'{a} n's theorem D Bradač
arXiv preprint arXiv:2205.08923, 2022
3 2022 Counting subgraphs in locally dense graphs D Bradač, B Sudakov, Y Wigderson
arXiv preprint arXiv:2406.12418, 2024
2 2024 Ramsey numbers of hypergraphs of a given size D Bradač, J Fox, B Sudakov
arXiv preprint arXiv:2308.10833, 2023
2 2023 11th Innovations in Theoretical Computer Science Conference (ITCS 2020) E Goldenberg, CS Karthik, O Paradise, A Schvartzman, SM Weinberg, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020
1 2020 Ordered Ramsey numbers of graphs with D Bradač, P Morawski, B Sudakov, Y Wigderson
arXiv preprint arXiv:2412.17599, 2024
2024 Unique subgraphs are rare D Bradač, M Christoph
arXiv preprint arXiv:2410.16233, 2024
2024 Clique density vs blowups D Bradač, H Liu, Z Wu, Z Xu
arXiv preprint arXiv:2410.07098, 2024
2024 On a question of Erd\H {o} s and Ne\v {s} et\v {r} il about minimal cuts in a graph D Bradač
arXiv preprint arXiv:2409.02974, 2024
2024 