Hossein Nassajian Mojarrad
École Polytechnique Fédérale de Lausanne
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Hossein Nassajian Mojarrad.
Discrete and Computational Geometry | 2016
Hossein Nassajian Mojarrad; Georgios Vlachos
Let ES(n) denote the minimum natural number such that every set of ES(n) points in general position in the plane contains n points in convex position. In 1935, Erdős and Szekeres proved that ES
Discrete and Computational Geometry | 2018
Aaron Lin; Mehdi Makhul; Hossein Nassajian Mojarrad; Josef Schicho; Konrad J. Swanepoel; Frank de Zeeuw
Computational Geometry: Theory and Applications | 2017
Radoslav Fulek; Hossein Nassajian Mojarrad; Márton Naszódi; József Solymosi; Sebastian U. Stich; May Szedlák
(n) \le {2n-4 \atopwithdelims ()n-2}+1
arXiv: Combinatorics | 2018
Hossein Nassajian Mojarrad; Thang Pham; Claudiu Valculescu; Frank de Zeeuw
arXiv: Combinatorics | 2016
Hossein Nassajian Mojarrad; Georgios Vlachos
(n)≤2n-4n-2+1. In 1961, they obtained the lower bound
arXiv: Combinatorics | 2014
Hossein Nassajian Mojarrad; Frank de Zeeuw
arXiv: Combinatorics | 2018
Doowon Koh; Hossein Nassajian Mojarrad; Thang Pham; Claudiu Valculescu
2^{n-2}+1 \le \mathrm{ES}(n)
arXiv: Combinatorics | 2017
Doowon Koh; Hossein Nassajian Mojarrad; Thang Pham; Claudiu Valculescu
Archive | 2017
Andreas F. Holmsen; Hossein Nassajian Mojarrad; János Pach; Gábor Tardos
2n-2+1≤ES(n), which they conjectured to be optimal. In this paper, we prove that
Archive | 2017
Andreas F. Holmsen; Hossein Nassajian Mojarrad; János Pach; Gábor Tardos
Collaboration
Dive into the Hossein Nassajian Mojarrad's collaboration.
