I study combinatorics and graph theory in particular. My research involves: local graph theory, the theory of tournaments, algebraic and geometric methods in combinatorics, high dimensional combinatorics, ramsey theory...
On the local structure of oriented graphs – a case study in flag algebras, Shoni Gilboa, Roman Glebov, Dan Hefetz, Nati Linial and Avraham Morgenstern. arXiv:1908.06480.
Ph.D. thesis: Local and Multidimensional Theories of Tournaments. Supervised by Prof. Nati Linial, submitted July 2014.
On the number of 4-cycles in a tournament, Nati Linial and Avraham Morgenstern. Journal of Graph Theory. Article first published online: 8 OCT 2015. Also available at arXiv:1405.1576.
Graphs with few 3-cliques and 3-anticliques are 3-universal, Nati Linial and Avraham Morgenstern. Journal of Graph Theory, Volume 78, Issue 3, March 2015, Pages 229–238. Also available at arXiv:1306.2020.
On high-dimensional acyclic tournaments, Nati Linial and Avraham Morgenstern, Discrete & Computational Geometry, Volume 50, Issue 4 (2013), Page 1085-1100. Also available at arXiv:1302.1684.
M.Sc. thesis: The behavior of the RSK algorithm under small perturbations in the input. Supervised by Prof. Nati Linial, submitted March 2007.
Here is some information about me.
By email: #1.#2@mail.huji.ac.il where #1=avraham and #2=morgenstern.
Phone: 972-547-248-xyz where x+1, y+1, z+1 = 2^7.
Visit my linkedin profile.