2015 Karshi Challenger – Doubles
Sergey Betov and Alexander Bury were the defending champions, but decided not to compete together. Bury played alongside Teymuraz Gabashvili, but lost to Yaraslav Shyla and Andrei Vasilevski in the first round. Betov competed with Mikhail Elgin and reached the final, but lost to Yuki Bhambri and Adrián Menéndez-Maceiras, 7–5, 3–6, [8–10].
Doubles | |
---|---|
2015 Karshi Challenger | |
Champions | |
Runners-up | |
Final score | 5–7, 6–3, [10–8] |
Seeds
Alexander Bury / Teymuraz Gabashvili (First round) Sergey Betov / Mikhail Elgin (Final) Saketh Myneni / Divij Sharan (Quarterfinals) Riccardo Ghedin / Ramkumar Ramanathan (Quarterfinals)
Draw
Key
- Q = Qualifier
- WC = Wild Card
- LL = Lucky Loser
- Alt = Alternate
- SE = Special Exempt
- PR = Protected Ranking
- ITF = ITF entry
- JE = Junior Exempt
- w/o = Walkover
- r = Retired
- d = Defaulted
First Round | Quarterfinals | Semifinals | Final | ||||||||||||||||||||||||
1 | 6 | 65 | [8] | ||||||||||||||||||||||||
4 | 77 | [10] | 3 | 3 | |||||||||||||||||||||||
4 | 6 | [10] | 6 | 6 | |||||||||||||||||||||||
WC | 6 | 3 | [8] | 6 | 3 | [7] | |||||||||||||||||||||
3 | 6 | 6 | 3 | 6 | [10] | ||||||||||||||||||||||
3 | 2 | 3 | 6 | 4 | [7] | ||||||||||||||||||||||
5 | 1 | 3 | 6 | [10] | |||||||||||||||||||||||
7 | 6 | 5 | 6 | [10] | |||||||||||||||||||||||
77 | 6 | 2 | 7 | 3 | [8] | ||||||||||||||||||||||
64 | 1 | 6 | 3 | [10] | |||||||||||||||||||||||
3 | 65 | 4 | 3 | 6 | [6] | ||||||||||||||||||||||
4 | 6 | 77 | 4 | 2 | |||||||||||||||||||||||
6 | 77 | 2 | 6 | 6 | |||||||||||||||||||||||
3 | 64 | 6 | 2 | [6] | |||||||||||||||||||||||
4 | 2 | 2 | 4 | 6 | [10] | ||||||||||||||||||||||
2 | 6 | 6 |
gollark: So just fit an explanation of the entire Riemann hypothesis in emojis into that, say?
gollark: Cool and good™ idea: encode millenium problems in this format.
gollark: I have to say, this does not look like an integer.
gollark: µhahahaha
gollark: Hmm, this is quite slow, initiating hacking into random IoT devices for more computing power.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.