default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShoham Letzter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Shoham Letzter
, Natasha Morrison:
Directed cycles with zero weight in Zpk. J. Comb. Theory B 168: 192-207 (2024)- [j28]Tao Jiang, Shoham Letzter, Abhishek Methuku, Liana Yepremyan:
Rainbow subdivisions of cliques. Random Struct. Algorithms 64(3): 625-644 (2024) - [j27]Natalie C. Behague, Tom Johnston, Shoham Letzter, Natasha Morrison, Shannon Ogden:
The Rainbow Saturation Number Is Linear. SIAM J. Discret. Math. 38(2): 1239-1249 (2024) - 2022
- [j26]Elad Aigner-Horev, Oran Danon, Dan Hefetz, Shoham Letzter:
Small rainbow cliques in randomly perturbed dense graphs. Eur. J. Comb. 101: 103452 (2022) - [j25]Elad Aigner-Horev, Oran Danon, Dan Hefetz, Shoham Letzter:
Large Rainbow Cliques in Randomly Perturbed Dense Graphs. SIAM J. Discret. Math. 36(4): 2975-2994 (2022) - [c2]Omri Ben-Eliezer, Shoham Letzter, Erik Waingarten:
Finding Monotone Patterns in Sublinear Time, Adaptively. ICALP 2022: 17:1-17:19 - 2021
- [j24]Vytautas Gruslys, Shoham Letzter:
Cycle partitions of regular graphs. Comb. Probab. Comput. 30(4): 526-549 (2021) - [j23]Dániel Korándi, Richard Lang, Shoham Letzter, Alexey Pokrovskiy:
Minimum degree conditions for monochromatic cycle partitioning. J. Comb. Theory B 146: 96-123 (2021) - 2020
- [j22]Matthew Kwan, Shoham Letzter, Benny Sudakov, Tuan Tran:
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs. Comb. 40(2): 283-305 (2020) - [j21]Matija Bucic, Sven Heberle, Shoham Letzter, Benny Sudakov:
Monochromatic trees in random tournaments. Comb. Probab. Comput. 29(3): 318-345 (2020) - [j20]Igor Balla, Shoham Letzter, Benny Sudakov:
Orthonormal Representations of H-Free Graphs. Discret. Comput. Geom. 64(3): 654-670 (2020) - [j19]Imre Leader, Shoham Letzter, Bhargav P. Narayanan, Mark Walters:
Product-free sets in the free semigroup. Eur. J. Comb. 83 (2020) - [j18]Shoham Letzter, Benny Sudakov:
The oriented size Ramsey number of directed paths. Eur. J. Comb. 88: 103103 (2020)
2010 – 2019
- 2019
- [j17]Shoham Letzter:
Monochromatic Cycle Partitions of 2-Coloured Graphs with Minimum Degree 3n/4. Electron. J. Comb. 26(1): 1 (2019) - [j16]Matija Bucic, Shoham Letzter, Benny Sudakov:
Multicolour Bipartite Ramsey Number of Paths. Electron. J. Comb. 26(3): 3 (2019) - [j15]Matija Bucic, Shoham Letzter, Benny Sudakov:
Directed Ramsey number for trees. J. Comb. Theory B 137: 145-177 (2019) - [j14]Shoham Letzter, Richard Snyder:
The homomorphism threshold of -free graphs. J. Graph Theory 90(1): 83-106 (2019) - [j13]António Girão, Shoham Letzter, Julian Sahasrabudhe:
Partitioning a graph into monochromatic connected subgraphs. J. Graph Theory 91(4): 353-364 (2019) - [j12]Matija Bucic, Shoham Letzter, Benny Sudakov:
3-Color bipartite Ramsey number of cycles and paths. J. Graph Theory 92(4): 445-459 (2019) - [j11]Matija Bucic, Shoham Letzter, Benny Sudakov:
Monochromatic paths in random tournaments. Random Struct. Algorithms 54(1): 69-81 (2019) - [j10]Shoham Letzter:
Many H-Copies in Graphs with a Forbidden Tree. SIAM J. Discret. Math. 33(4): 2360-2368 (2019) - [c1]Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter, Erik Waingarten:
Finding Monotone Patterns in Sublinear Time. FOCS 2019: 1469-1494 - [i4]Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter, Erik Waingarten:
Finding monotone patterns in sublinear time. CoRR abs/1910.01749 (2019) - [i3]Omri Ben-Eliezer, Shoham Letzter, Erik Waingarten:
Optimal Adaptive Detection of Monotone Patterns. CoRR abs/1911.01169 (2019) - [i2]Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter, Erik Waingarten:
Finding monotone patterns in sublinear time. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j9]Vytautas Gruslys, Shoham Letzter:
Minimizing the Number of Triangular Edges. Comb. Probab. Comput. 27(4): 580-622 (2018) - [j8]Béla Bollobás, Shoham Letzter:
Longest common extension. Eur. J. Comb. 68: 242-248 (2018) - [j7]Béla Bollobás, Jonathan Lee, Shoham Letzter:
Eigenvalues of subgraphs of the cube. Eur. J. Comb. 70: 125-148 (2018) - 2017
- [j6]Shoham Letzter:
Radon numbers for trees. Discret. Math. 340(3): 333-344 (2017) - [j5]Matija Bucic, Shoham Letzter, Benny Sudakov:
Directed Ramsey number for trees. Electron. Notes Discret. Math. 61: 169-175 (2017) - [j4]Matija Bucic, Shoham Letzter, Benny Sudakov:
Monochromatic paths in random tournaments. Electron. Notes Discret. Math. 61: 177-183 (2017) - 2016
- [j3]Shoham Letzter:
Path Ramsey Number for Random Graphs. Comb. Probab. Comput. 25(4): 612-622 (2016) - 2015
- [j2]Shoham Letzter:
Large Monochromatic Triple Stars in Edge Colourings. J. Graph Theory 80(4): 323-328 (2015) - 2013
- [j1]Shoham Letzter:
The property of having a k -regular subgraph has a sharp threshold. Random Struct. Algorithms 42(4): 509-519 (2013) - [i1]Shoham Letzter:
The Property of Having a $k$-Regular Subgraph Has a Sharp Threshold. CoRR abs/1310.5141 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-29 00:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
