CaltechAUTHORS
  A Caltech Library Service

Items where Person is "Sudakov-B"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | First Author | No Grouping
Jump to: 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2007 | 2006 | 2005
Number of items: 29.

2020

Conlon, David and Fox, Jacob and Sudakov, Benny (2020) Short proofs of some extremal results III. Random Structures & Algorithms, 57 (4). pp. 958-982. ISSN 1042-9832. https://resolver.caltech.edu/CaltechAUTHORS:20200909-070916091

Conlon, David and Fox, Jacob and Sudakov, Benny et al. (2020) The regularity method for graphs with few 4-cycles. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20200914-101307280

Conlon, David and Fox, Jacob and Sudakov, Benny (2020) Books versus triangles at the extremal density. SIAM Journal on Discrete Mathematics, 34 (1). pp. 385-398. ISSN 0895-4801. https://resolver.caltech.edu/CaltechAUTHORS:20190819-170946478

2019

Conlon, David and Fox, Jacob and Kwan, Matthew et al. (2019) Hypergraph cuts above the average. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190819-170914451

Conlon, David and Fox, Jacob and Sudakov, Benny (2019) Tower-type bounds for unavoidable patterns in words. Transactions of the American Mathematical Society . ISSN 0002-9947. https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000172

Conlon, David and Fox, Jacob and Sudakov, Benny (2019) Independent arithmetic progressions. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190819-170939635

2018

Conlon, David and Fox, Jacob and Sudakov, Benny (2018) Hereditary quasirandomness without regularity. Mathematical Proceedings of the Cambridge Philosophical Society, 164 (3). pp. 385-399. ISSN 0305-0041. https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959631

2017

Conlon, David and Fox, Jacob and Lee, Choongbum et al. (2017) Ordered Ramsey numbers. Journal of Combinatorial Theory, Series B, 122 . pp. 353-383. ISSN 0095-8956. https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000833

2016

Conlon, David and Fox, Jacob and Sudakov, Benny (2016) Short proofs of some extremal results II. Journal of Combinatorial Theory, Series B, 121 . pp. 173-196. ISSN 0095-8956. https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000938

Conlon, David and Fox, Jacob and Lee, Choongbum et al. (2016) Ramsey numbers of cubes versus cliques. Combinatorica, 36 (1). pp. 37-70. ISSN 0209-9683. https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959158

2015

Conlon, David and Fox, Jacob and Lee, Choongbum et al. (2015) On the Grid Ramsey Problem and Related Questions. International Mathematics Research Notices, 2015 (17). pp. 8052-8084. ISSN 1073-7928. https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959982

Conlon, David and Fox, Jacob and Sudakov, Benny (2015) Recent developments in graph Ramsey theory. In: Surveys in Combinatorics 2015. London Mathematical Society Lecture Note Series. No.424. Cambridge University Press , Cambridge, United Kingdom, pp. 49-118. ISBN 9781316106853. https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959899

Conlon, David and Fox, Jacob and Lee, Choongbum et al. (2015) The Erdős-Gyárfás problem on generalized Ramsey numbers. Proceedings of the London Mathematical Society, 110 (1). pp. 1-18. ISSN 0024-6115. https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959803

2014

Conlon, David and Fox, Jacob and Sudakov, Benny (2014) Cycle packing. Random Structures & Algorithms, 45 (4). pp. 608-626. ISSN 1042-9832. https://resolver.caltech.edu/CaltechAUTHORS:20190812-163001129

Conlon, David and Fox, Jacob and Pach, János et al. (2014) Ramsey-type results for semi-algebraic relations. Transactions of the American Mathematical Society, 366 (9). pp. 5043-5065. ISSN 0002-9947. https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000075

Conlon, David and Fox, Jacob and Sudakov, Benny (2014) Large subgraphs without complete bipartite graphs. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190819-170849884

Conlon, David and Fox, Jacob and Sudakov, Benny (2014) Short Proofs of Some Extremal Results. Combinatorics, Probability and Computing, 23 (1). pp. 8-28. ISSN 0963-5483. https://resolver.caltech.edu/CaltechAUTHORS:20190812-162956937

2013

Conlon, David and Fox, Jacob and Sudakov, Benny (2013) Two extensions of Ramsey’s theorem. Duke Mathematical Journal, 162 (15). pp. 2903-2927. ISSN 0012-7094. https://resolver.caltech.edu/CaltechAUTHORS:20190812-162959551

Conlon, David and Fox, Jacob and Sudakov, Benny (2013) An improved bound for the stepping-up lemma. Discrete Applied Mathematics, 161 (9). pp. 1191-1196. ISSN 0166-218X. https://resolver.caltech.edu/CaltechAUTHORS:20190812-162957165

2012

Conlon, David and Fox, Jacob and Sudakov, Benny (2012) Sidorenko's conjecture for a class of graphs: an exposition. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190819-170842963

Conlon, David and Fox, Jacob and Sudakov, Benny (2012) Erdős-Hajnal-type theorems in hypergraphs. Journal of Combinatorial Theory, Series B, 102 (5). pp. 1142-1154. ISSN 0095-8956. https://resolver.caltech.edu/CaltechAUTHORS:20190812-162957444

Conlon, David and Fox, Jacob and Sudakov, Benny (2012) On two problems in graph Ramsey theory. Combinatorica, 32 (5). pp. 513-535. ISSN 0209-9683. https://resolver.caltech.edu/CaltechAUTHORS:20190812-162958859

2011

Conlon, David and Fox, Jacob and Sudakov, Benny (2011) Large almost monochromatic subsets in hypergraphs. Israel Journal of Mathematics, 181 (1). pp. 423-432. ISSN 0021-2172. https://resolver.caltech.edu/CaltechAUTHORS:20190812-162958677

2010

Conlon, David and Fox, Jacob and Sudakov, Benny (2010) An Approximate Version of Sidorenko’s Conjecture. Geometric and Functional Analysis, 20 (6). pp. 1354-1366. ISSN 1016-443X. https://resolver.caltech.edu/CaltechAUTHORS:20190812-162958544

Conlon, David and Fox, Jacob and Sudakov, Benny (2010) Hypergraph Ramsey numbers. Journal of the American Mathematical Society, 23 (1). pp. 247-266. ISSN 0894-0347. https://resolver.caltech.edu/CaltechAUTHORS:20190812-163000262

2009

Conlon, David and Fox, Jacob and Sudakov, Benny (2009) Ramsey numbers of sparse hypergraphs. Random Structures & Algorithms, 35 (1). pp. 1-14. ISSN 1042-9832. https://resolver.caltech.edu/CaltechAUTHORS:20190812-163001597

2007

Keevash, Peter and Mubayi, Dhruv and Sudakov, Benny et al. (2007) Rainbow Turán Problems. Combinatorics, Probability, and Computing, 16 (1). pp. 109-126. ISSN 0963-5483. https://resolver.caltech.edu/CaltechAUTHORS:KEEcpc07

2006

Keevash, Peter and Loh, Po-Shen and Sudakov, Benny (2006) Bounding the Number of Edges in Permutation Graphs. Electronic Journal of Combinatorics, 13 (1). R44. ISSN 1077-8926. https://resolver.caltech.edu/CaltechAUTHORS:KEEejc06

2005

Kevash, Peter and Sudakov, Benny (2005) Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices. SIAM Journal on Discrete Mathematics, 18 (4). pp. 713-727. ISSN 0895-4801. https://resolver.caltech.edu/CaltechAUTHORS:KEEsiamjdm05

This list was generated on Thu May 13 03:31:15 2021 PDT.