| Intersecting families of discrete structures are typically trivial J Balogh, S Das, M Delcourt, H Liu, M Sharifzadeh Journal of Combinatorial Theory, Series A 132, 224-245, 2015 | 50* | 2015 |
| Rainbow Turán problem for even cycles S Das, C Lee, B Sudakov European Journal of Combinatorics 34 (5), 905-915, 2013 | 48 | 2013 |
| Removal and Stability for Erdös--Ko--Rado S Das, T Tran SIAM Journal on Discrete Mathematics 30 (2), 1102-1114, 2016 | 45* | 2016 |
| Sperner's theorem and a problem of Erdős, Katona and Kleitman S Das, W Gan, B Sudakov Combinatorics, Probability and Computing 24 (4), 585-608, 2015 | 43 | 2015 |
| The minimum number of disjoint pairs in set systems and related problems S Das, W Gan, B Sudakov Combinatorica 36, 623-660, 2016 | 37 | 2016 |
| A problem of Erdős on the minimum number of k-cliques S Das, H Huang, J Ma, H Naves, B Sudakov Journal of Combinatorial Theory, Series B 103 (3), 344-373, 2013 | 35 | 2013 |
| Ramsey properties of randomly perturbed graphs: cliques and cycles S Das, A Treglown Combinatorics, Probability and Computing 29 (6), 830-867, 2020 | 32 | 2020 |
| A brief note on estimates of binomial coefficients S Das URL: http://page. mi. fu-berlin. de/shagnik/notes/binomials. pdf, 2016 | 26 | 2016 |
| Vertex Ramsey properties of randomly perturbed graphs S Das, P Morris, A Treglown Random Structures & Algorithms 57 (4), 983-1006, 2020 | 21 | 2020 |
| Strong blocking sets and minimal codes from expander graphs N Alon, A Bishnoi, S Das, A Neri Transactions of the American Mathematical Society 377 (08), 5389-5410, 2024 | 15 | 2024 |
| Structure and supersaturation for intersecting families J Balogh, S Das, H Liu, M Sharifzadeh, T Tran arXiv preprint arXiv:1802.08018, 2018 | 15 | 2018 |
| Colourings without monochromatic disjoint pairs D Clemens, S Das, T Tran European journal of combinatorics 70, 99-124, 2018 | 12 | 2018 |
| Small arrays of maximum coverage S Das, T Mészáros Journal of Combinatorial Designs 26 (10), 487-504, 2018 | 10* | 2018 |
| Comparable pairs in families of sets N Alon, S Das, R Glebov, B Sudakov Journal of Combinatorial Theory, Series B 115, 164-185, 2015 | 10 | 2015 |
| Subspace coverings with multiplicities A Bishnoi, S Boyadzhiyska, S Das, T Mészáros Combinatorics, Probability and Computing 32 (5), 782-795, 2023 | 9 | 2023 |
| A brief note on estimates of binomial coefficients (2016) S Das URL: http://page. mi. fu-berlin. de/shagnik/notes/binomials. pdf, 2020 | 9 | 2020 |
| Colouring set families without monochromatic k-chains S Das, R Glebov, B Sudakov, T Tran Journal of Combinatorial Theory, Series A 168, 84-119, 2019 | 7 | 2019 |
| Most probably intersecting hypergraphs S Das, B Sudakov arXiv preprint arXiv:1312.0840, 2013 | 7 | 2013 |
| Tight bounds for divisible subdivisions S Das, N Draganić, R Steiner Journal of Combinatorial Theory, Series B 165, 1-19, 2024 | 6 | 2024 |
| Schur properties of randomly perturbed sets S Das, C Knierim, P Morris European Journal of Combinatorics 121, 103843, 2024 | 5 | 2024 |
Benjamin SudakovETH, ZurichEmail verificata su math.ethz.ch