Periodo de publicación recogido
|
|
|
Threshold Ramsey multiplicity for odd cycles
David Conlon, Jacob Fox, Benny Sudakov, Fang Wei
Revista de la Unión Matemática Argentina, ISSN 0041-6932, ISSN-e 1669-9637, Vol. 64, Nº. Extra 1, 2022, págs. 49-68
Shagnik Das, Benny Sudakov, Pedro Vieira
Journal of Combinatorial Theory, Series A, ISSN 1096-0899, Nº. 138, 2015, págs. 175-207
On the number of monotone sequences
Wojciech Samotij, Benny Sudakov
Journal of combinatorial theory. Series B, ISSN 0095-8956, Nº. 115, 2015, págs. 132-163
Comparable pairs in families of sets
Noga Alon, Shagnik Das, Roman Glebov, Benny Sudakov
Journal of combinatorial theory. Series B, ISSN 0095-8956, Nº. 115, 2015, págs. 164-185
Turán numbers of bipartite graphs plus an odd cycle
Peter Allen, Peter Keevash, Benny Sudakov, Jacques Verstraëte
Journal of combinatorial theory. Series B, ISSN 0095-8956, Nº. 106, 2014, págs. 134-162
Ramsey-type results for semi-algebraic relations
David Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk
Transactions of the American Mathematical Society, ISSN 0002-9947, Vol. 366, Nº 9, 2014, págs. 5043-5065
Robust Hamiltonicity of Dirac graphs
Michael Krivelevich, Choongbum Lee, Benny Sudakov
Transactions of the American Mathematical Society, ISSN 0002-9947, Vol. 366, Nº 6, 2014, págs. 3095-3130
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdos-Fajtlowicz
Jacob Fox, Choongbum Lee, Benny Sudakov
Combinatorica, ISSN 0209-9683, Vol. 33, Nº. 2, 2013, págs. 181-197
Two extensions of Ramsey�s theorem
David Conlon, Jacob Fox, Benny Sudakov
Duke Mathematical Journal, ISSN 0012-7094, Vol. 162, Nº. 15, 2013, págs. 2903-2927
Choongbum Lee, Po-Shen Loh, Benny Sudakov
Journal of combinatorial theory. Series B, ISSN 0095-8956, Vol. 103, Nº. 5, 2013, págs. 599-629
A problem of Erdos on the minimum number of k-cliques
Shagnik Das, Hao Huang, Jie Ma, Humberto Naves, Benny Sudakov
Journal of combinatorial theory. Series B, ISSN 0095-8956, Vol. 103, Nº. 3, 2013, págs. 344-373
On two problems in graph Ramsey theory
David Conlon, Jacob Fox, Benny Sudakov
Combinatorica, ISSN 0209-9683, Vol. 32, Nº. 5, 2012, págs. 513-535
A counterexample to the Alon-Saks-Seymour conjecture and related problems
Hao Huang, Benny Sudakov
Combinatorica, ISSN 0209-9683, Vol. 32, Nº. 2, 2012, págs. 205-219
Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels
Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski, Benny Sudakov
Journal of Combinatorial Theory, Series A, ISSN 1096-0899, Vol. 119, Nº. 6, 2012, págs. 1200-1215
Erdos-Hajnal-type theorems in hypergraphs
David Conlon, Jacob Fox, Benny Sudakov
Journal of combinatorial theory. Series B, ISSN 0095-8956, Vol. 102, Nº. 5, 2012, págs. 1142-1154
The size Ramsey number of a directed path
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
Journal of combinatorial theory. Series B, ISSN 0095-8956, Vol. 102, Nº. 3, 2012, págs. 743-755
Nonnegative k-sums, fractional covers, and probability of small deviations
Noga Alon, Hao Huang, Benny Sudakov
Journal of combinatorial theory. Series B, ISSN 0095-8956, Vol. 102, Nº. 3, 2012, págs. 784-796
Bandwidth theorem for random graphs
Hao Huang, Choongbum Lee, Benny Sudakov
Journal of combinatorial theory. Series B, ISSN 0095-8956, Vol. 102, Nº. 1, 2012, págs. 14-37
Erdos-Szekeres-type theorems for monotone paths and convex bodies
Jacob Fox, János Pach, Benny Sudakov, Andrew Suk
Proceedings of the London Mathematical Society, ISSN 0024-6115, Vol. 105, Nº 5, 2012, págs. 953-982
Spectra of lifted Ramanujan graphs
Eyal Lubetzky, Benny Sudakov, Van H. Vu
Advances in mathematics, ISSN 0001-8708, Vol. 227, Nº 4, 2011, págs. 1612-1645
A conjecture of Erdos on graph Ramsey numbers
Benny Sudakov
Advances in mathematics, ISSN 0001-8708, Vol. 227, Nº 1, 2011, págs. 601-609
Generating all subsets of a finite set with disjoint unions
David Ellis, Benny Sudakov
Journal of Combinatorial Theory, Series A, ISSN 1096-0899, Vol. 118, Nº. 8, 2011, págs. 2319-2345
A randomized embedding algorithm for trees
Benny Sudakov, Jan Vondrák
Combinatorica, ISSN 0209-9683, Vol. 30, Nº. 4, 2010, págs. 445-470
Pancyclicity of Hamiltonian and highly connected graphs
Peter Keevash, Benny Sudakov
Journal of combinatorial theory. Series B, ISSN 0095-8956, Vol. 100, Nº. 5, 2010, págs. 456-467
David Conlon, Jacob Fox, Benny Sudakov
Journal of the American Mathematical Society, ISSN 0894-0347, Vol. 23, Nº 1, 2010, págs. 247-266
Maximizing the number of q-colorings
Loh Po-Shen, Oleg Pikhurko, Benny Sudakov
Proceedings of the London Mathematical Society, ISSN 0024-6115, Vol. 101, Nº 3, 2010, págs. 655-696
Additive approximation for edge-deletion problems
Noga Alon, Asaf Shapira, Benny Sudakov
Annals of mathematics, ISSN 0003-486X, Vol. 170, Nº 1, 2009, págs. 371-411
Density theorems for bipartite graphs and related Ramsey-type results
Jacob Fox, Benny Sudakov
Combinatorica, ISSN 0209-9683, Vol. 29, Nº. 2, 2009, págs. 153-196
Jacob Fox, Benny Sudakov
Advances in mathematics, ISSN 0001-8708, Vol. 219, Nº 6, 2008, págs. 1771-1801
Induced subgraphs of Ramsey graphs with many distinct degrees
Boris Bukh, Benny Sudakov
Journal of combinatorial theory. Series B, ISSN 0095-8956, Vol. 97, Nº. 4, 2007, págs. 612-619
Esta página recoge referencias bibliográficas de materiales disponibles en los fondos de las Bibliotecas que participan en Dialnet. En ningún caso se trata de una página que recoja la producción bibliográfica de un autor de manera exhaustiva. Nos gustaría que los datos aparecieran de la manera más correcta posible, de manera que si detecta algún error en la información que facilitamos, puede hacernos llegar su Sugerencia / Errata.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados