2019 Australian Open – Mixed Doubles
Barbora Krejčíková and Rajeev Ram won the Mixed Doubles tennis title at the 2019 Australian Open, defeating Astra Sharma and John-Patrick Smith in the final, 7–6(7–3), 6–1.
Mixed Doubles | |
---|---|
2019 Australian Open | |
Champions | ![]() ![]() |
Runners-up | ![]() ![]() |
Final score | 7–6(7–3), 6–1 |
Gabriela Dabrowski and Mate Pavić were the defending champions, but lost in the quarterfinals to María José Martínez Sánchez and Neal Skupski.
Seeds
Gabriela Dabrowski / Mate Pavić (Quarterfinals) Nicole Melichar / Bruno Soares (Semifinals) Barbora Krejčíková / Rajeev Ram (Champions) Mihaela Buzărnescu / Oliver Marach (First round, retired) Anna-Lena Grönefeld / Robert Farah (Quarterfinals) Abigail Spears / Juan Sebastián Cabal (Quarterfinals) Makoto Ninomiya / Ben McLachlan (First round) Ekaterina Makarova / Artem Sitak (First round)
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
Finals
Semifinals | Final | ||||||||||||
![]() ![]() | 0 | 4 | |||||||||||
3 | ![]() ![]() | 6 | 6 | ||||||||||
3 | ![]() ![]() | 77 | 6 | ||||||||||
WC | ![]() ![]() | 63 | 1 | ||||||||||
WC | ![]() ![]() | 6 | 77 | ||||||||||
2 | ![]() ![]() | 4 | 65 | ||||||||||
Top half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||||||
WC | ![]() ![]() | 3 | 3 | 1 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||
![]() ![]() | 4 | 4 | ![]() ![]() | 4 | 3 | ||||||||||||||||||||||
![]() ![]() | 6 | 6 | 1 | ![]() ![]() | 1 | 6 | [9] | ||||||||||||||||||||
![]() ![]() | 3 | 3 | ![]() ![]() | 6 | 4 | [11] | |||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||||
WC | ![]() ![]() | 6 | 3 | [10] | WC | ![]() ![]() | 4 | 1 | |||||||||||||||||||
7 | ![]() ![]() | 2 | 6 | [5] | ![]() ![]() | 0 | 4 | ||||||||||||||||||||
3 | ![]() ![]() | 1 | 6 | [10] | 3 | ![]() ![]() | 6 | 6 | |||||||||||||||||||
![]() ![]() | 6 | 2 | [6] | 3 | ![]() ![]() | 6 | 4 | [10] | |||||||||||||||||||
![]() ![]() | 1 | 6 | [5] | WC | ![]() ![]() | 3 | 6 | [5] | |||||||||||||||||||
WC | ![]() ![]() | 6 | 2 | [10] | 3 | ![]() ![]() | 6 | 7 | |||||||||||||||||||
WC | ![]() ![]() | 6 | 7 | 5 | ![]() ![]() | 2 | 5 | ||||||||||||||||||||
![]() ![]() | 4 | 5 | WC | ![]() ![]() | 6 | 4 | [8] | ||||||||||||||||||||
![]() ![]() | 6 | 3 | [6] | 5 | ![]() ![]() | 4 | 6 | [10] | |||||||||||||||||||
5 | ![]() ![]() | 3 | 6 | [10] |
Bottom half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
8 | ![]() ![]() | 3 | 4 | ||||||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 4 | 5 | ||||||||||||||||||||||
WC | ![]() ![]() | 6 | 6 | WC | ![]() ![]() | 6 | 7 | ||||||||||||||||||||
WC | ![]() ![]() | 1 | 2 | WC | ![]() ![]() | 6 | 77 | ||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 2 | 65 | ||||||||||||||||||||||
![]() ![]() | 2 | 2 | ![]() ![]() | 4 | 4 | ||||||||||||||||||||||
![]() ![]() | 4 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||||
4 | ![]() ![]() | 1r | WC | ![]() ![]() | 6 | 77 | |||||||||||||||||||||
6 | ![]() ![]() | 7 | 6 | 2 | ![]() ![]() | 4 | 65 | ||||||||||||||||||||
![]() ![]() | 5 | 2 | 6 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
![]() ![]() | 6 | 77 | ![]() ![]() | 1 | 2 | ||||||||||||||||||||||
WC | ![]() ![]() | 4 | 61 | 6 | ![]() ![]() | 1 | 63 | ||||||||||||||||||||
WC | ![]() ![]() | 3 | 6 | [7] | 2 | ![]() ![]() | 6 | 77 | |||||||||||||||||||
![]() ![]() | 6 | 4 | [10] | ![]() ![]() | 3 | 2 | |||||||||||||||||||||
![]() ![]() | 1 | 3 | 2 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
2 | ![]() ![]() | 6 | 6 |
gollark: It is, but that is not actually the point.
gollark: Wrong.
gollark: The obvious approach to this task is to reduce bingo to something easier, like the halting problem.
gollark: Will you compile with `nim c` too?
gollark: Oh, Nim can compile to C, can't it...
References
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.