The Property of Having a $k$-Regular Subgraph Has a Sharp Threshold. - Shoham Letzter (CoRR, 2013)

The property of having a k -regular subgraph has a sharp threshold. - Shoham Letzter (Random Struct. Algorithms, 2013)

Large Monochromatic Triple Stars in Edge Colourings. - Shoham Letzter (J. Graph Theory, 2015)

Path Ramsey Number for Random Graphs. - Shoham Letzter (Comb. Probab. Comput., 2016)

Radon numbers for trees. - Shoham Letzter (Discret. Math., 2017)

Monochromatic paths in random tournaments. - Matija Bucic; Shoham Letzter; Benny Sudakov (Electron. Notes Discret. Math., 2017)

Minimizing the Number of Triangular Edges. - Vytautas Gruslys; Shoham Letzter (Comb. Probab. Comput., 2018)

Longest common extension. - Béla Bollobás; Shoham Letzter (Eur. J. Comb., 2018)

Eigenvalues of subgraphs of the cube. - Béla Bollobás; Jonathan Lee; Shoham Letzter (Eur. J. Comb., 2018)

Multicolour Bipartite Ramsey Number of Paths. - Matija Bucic; Shoham Letzter; Benny Sudakov (Electron. J. Comb., 2019)

Monochromatic Cycle Partitions of 2-Coloured Graphs with Minimum Degree 3n/4. - Shoham Letzter (Electron. J. Comb., 2019)

Optimal Adaptive Detection of Monotone Patterns. - Omri Ben-Eliezer; Shoham Letzter; Erik Waingarten (CoRR, 2019)

Finding monotone patterns in sublinear time. - Omri Ben-Eliezer; Clément L. Canonne; Shoham Letzter; Erik Waingarten (Electron. Colloquium Comput. Complex., 2019)

Directed Ramsey number for trees. - Matija Bucic; Shoham Letzter; Benny Sudakov (J. Comb. Theory B, 2019)

3-Color bipartite Ramsey number of cycles and paths. - Matija Bucic; Shoham Letzter; Benny Sudakov (J. Graph Theory, 2019)

Partitioning a graph into monochromatic connected subgraphs. - António Girão; Shoham Letzter; Julian Sahasrabudhe (J. Graph Theory, 2019)

The homomorphism threshold of -free graphs. - Shoham Letzter; Richard Snyder (J. Graph Theory, 2019)

Many H-Copies in Graphs with a Forbidden Tree. - Shoham Letzter (SIAM J. Discret. Math., 2019)

Dense Induced Bipartite Subgraphs in Triangle-Free Graphs. - Matthew Kwan 001; Shoham Letzter; Benny Sudakov; Tuan Tran (Comb., 2020)

Monochromatic trees in random tournaments. - Matija Bucic; Sven Heberle; Shoham Letzter; Benny Sudakov (Comb. Probab. Comput., 2020)

Orthonormal Representations of H-Free Graphs. - Igor Balla; Shoham Letzter; Benny Sudakov (Discret. Comput. Geom., 2020)

Product-free sets in the free semigroup. - Imre Leader; Shoham Letzter; Bhargav P. Narayanan; Mark Walters (Eur. J. Comb., 2020)

The oriented size Ramsey number of directed paths. - Shoham Letzter; Benny Sudakov (Eur. J. Comb., 2020)

Cycle partitions of regular graphs. - Vytautas Gruslys; Shoham Letzter (Comb. Probab. Comput., 2021)

Minimum degree conditions for monochromatic cycle partitioning. - Dániel Korándi; Richard Lang; Shoham Letzter; Alexey Pokrovskiy (J. Comb. Theory B, 2021)

Finding Monotone Patterns in Sublinear Time, Adaptively. - Omri Ben-Eliezer; Shoham Letzter; Erik Waingarten (ICALP, 2022)

Small rainbow cliques in randomly perturbed dense graphs. - Elad Aigner-Horev; Oran Danon; Dan Hefetz; Shoham Letzter (Eur. J. Comb., 2022)

Large Rainbow Cliques in Randomly Perturbed Dense Graphs. - Elad Aigner-Horev; Oran Danon; Dan Hefetz; Shoham Letzter (SIAM J. Discret. Math., 2022)

Rainbow Hamiltonicity in uniformly coloured perturbed digraphs. - Kyriakos Katsamaktsis; Shoham Letzter; Amedeo Sgueglia (Comb. Probab. Comput., 2024)

Directed cycles with zero weight in Zpk. - Shoham Letzter; Natasha Morrison (J. Comb. Theory B, 2024)

The Rainbow Saturation Number Is Linear. - Natalie C. Behague; Tom Johnston; Shoham Letzter; Natasha Morrison; Shannon Ogden (SIAM J. Discret. Math., 2024)

Rainbow subdivisions of cliques. - Tao Jiang 003; Shoham Letzter; Abhishek Methuku; Liana Yepremyan (Random Struct. Algorithms, 2024)

Thresholds for constrained Ramsey and anti-Ramsey problems. - Natalie C. Behague; Robert Hancock 002; Joseph Hyde; Shoham Letzter; Natasha Morrison (Eur. J. Comb., 2025)

Building graphs with high minimum degree on a budget. - Kyriakos Katsamaktsis; Shoham Letzter (Eur. J. Comb., 2025)

Ascending subgraph decomposition. - Kyriakos Katsamaktsis; Shoham Letzter; Alexey Pokrovskiy; Benny Sudakov (J. Comb. Theory B, 2025)

Partitioning a tournament into sub-tournaments of high connectivity. - António Girão; Shoham Letzter (Comb., 2025)