Các bài viết có thể truy cập công khai - Benjamin SudakovTìm hiểu thêm
Không có ở bất kỳ nơi nào: 1
Lower bounds for max-cut via semidefinite programming
C Carlson, A Kolla, R Li, N Mani, B Sudakov, L Trevisan
Latin American Symposium on Theoretical Informatics, 479-490, 2020
Các cơ quan ủy nhiệm: US National Science Foundation, Swiss National Science Foundation, European …
Có tại một số nơi: 156
A proof of Ringel’s conjecture
R Montgomery, A Pokrovskiy, B Sudakov
Geometric and Functional Analysis 31 (3), 663-720, 2021
Các cơ quan ủy nhiệm: Swiss National Science Foundation, European Commission
Erdős–Szekeres‐type theorems for monotone paths and convex bodies
J Fox, J Pach, B Sudakov, A Suk
Proceedings of the London Mathematical Society 105 (5), 953-982, 2012
Các cơ quan ủy nhiệm: Swiss National Science Foundation, Hungarian Scientific Research Fund
Bounded-degree spanning trees in randomly perturbed graphs
M Krivelevich, M Kwan, B Sudakov
SIAM Journal on Discrete Mathematics 31 (1), 155-171, 2017
Các cơ quan ủy nhiệm: US National Science Foundation, Swiss National Science Foundation
Equiangular lines and spherical codes in Euclidean space
I Balla, F Dräxler, P Keevash, B Sudakov
Inventiones mathematicae 211 (1), 179-212, 2018
Các cơ quan ủy nhiệm: Swiss National Science Foundation, European Commission
Ordered Ramsey numbers
D Conlon, J Fox, C Lee, B Sudakov
Journal of Combinatorial Theory, Series B 122, 353-383, 2017
Các cơ quan ủy nhiệm: US National Science Foundation, Swiss National Science Foundation
Robust hamiltonicity of Dirac graphs
M Krivelevich, C Lee, B Sudakov
Transactions of the American Mathematical Society 366 (6), 3095-3130, 2014
Các cơ quan ủy nhiệm: Swiss National Science Foundation
Cycles and matchings in randomly perturbed digraphs and hypergraphs
M Krivelevich, M Kwan, B Sudakov
Combinatorics, Probability and Computing 25 (6), 909-927, 2016
Các cơ quan ủy nhiệm: US National Science Foundation, Swiss National Science Foundation
Maximizing the number of independent sets of a fixed size
W Gan, PS Loh, B Sudakov
Combinatorics, Probability and Computing 24 (3), 521-527, 2015
Các cơ quan ủy nhiệm: Swiss National Science Foundation
Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
N Alon, A Pokrovskiy, B Sudakov
Israel Journal of Mathematics 222, 317-331, 2017
Các cơ quan ủy nhiệm: US National Science Foundation, Swiss National Science Foundation
Decompositions into spanning rainbow structures
R Montgomery, A Pokrovskiy, B Sudakov
Proceedings of the London Mathematical Society 119 (4), 899-959, 2019
Các cơ quan ủy nhiệm: Swiss National Science Foundation
New bounds for Ryser’s conjecture and related problems
P Keevash, A Pokrovskiy, B Sudakov, L Yepremyan
Transactions of the American Mathematical Society, Series B 9 (8), 288-321, 2022
Các cơ quan ủy nhiệm: Swiss National Science Foundation, European Commission
The Erdős–Gyárfás problem on generalized Ramsey numbers
D Conlon, J Fox, C Lee, B Sudakov
Proceedings of the London Mathematical Society 110 (1), 1-18, 2015
Các cơ quan ủy nhiệm: Swiss National Science Foundation
Embedding rainbow trees with applications to graph labelling and decomposition
R Montgomery, A Pokrovskiy, B Sudakov
Journal of the European Mathematical Society 22 (10), 3101-3132, 2020
Các cơ quan ủy nhiệm: Swiss National Science Foundation
The zero forcing number of graphs
T Kalinowski, N Kamcev, B Sudakov
SIAM journal on discrete mathematics 33 (1), 95-115, 2019
Các cơ quan ủy nhiệm: Swiss National Science Foundation
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
Các cơ quan ủy nhiệm: Swiss National Science Foundation
Ramsey-type results for semi-algebraic relations
D Conlon, J Fox, J Pach, B Sudakov, A Suk
Proceedings of the twenty-ninth annual symposium on Computational geometry …, 2013
Các cơ quan ủy nhiệm: Swiss National Science Foundation, Hungarian Scientific Research Fund
The minimum number of disjoint pairs in set systems and related problems
S Das, W Gan, B Sudakov
Combinatorica 36, 623-660, 2016
Các cơ quan ủy nhiệm: US National Science Foundation
Turán numbers of bipartite graphs plus an odd cycle
P Allen, P Keevash, B Sudakov, J Verstraëte
Journal of Combinatorial Theory, Series B 106, 134-162, 2014
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council, European Commission
Short proofs of some extremal results II
D Conlon, J Fox, B Sudakov
Journal of Combinatorial Theory, Series B 121, 173-196, 2016
Các cơ quan ủy nhiệm: US National Science Foundation, Swiss National Science Foundation, European …
Chương trình máy tính sẽ tự động xác định thông tin xuất bản và thông tin về nhà tài trợ