My research lies in combinatorics,
discrete geometry, and combinatorial topology. In particular I am interested in matching theory of graphs and hypergraphs, extremal graph theory, piercing numbers of hypergraphs arising from geometrical structures, epsilon-nets, distinct distances and other Erdos-type problems, fair division problems, and applications of discrete geometry to social sciences; I enjoy exploring for new tools to apply in all the above, with emphasis on topological tools.
Clique-coloring of the unit disk graph (with B. Slomka and Y. Yuditsky).
Almost all graphs satisfy Tuza’s conjecture (with P. Bennett and A. Dudek).
Helly’s theorem with no dimensions (with H. Huang and B. Slomka).
Piercing discrete line segments (with D. Oliveros and C. ONeill).
Winter 2018: Math 567 - Introduction to Coding Theory (University of Michigan).
Winter 2017: Math 567 - Introduction to Coding Theory (University of Michigan).
Fall 2016: Math 465 - Introduction to Combinatorics (University of Michigan).
Winter 2016: Math 567 - Introduction to Coding Theory (University of Michigan).
Fall 2015: Math 115 - Calculus I (University of Michigan).
2009-2014: Teaching Assistant - Linear Algebra, Abstract Algebra, Field Theory, Calculus II (Technion).