Menachem Kojman

Menachem Kojman’s research involves problems in finite and infinite combinatorics in modern set-theoretic context. Metamathematical means are useful in addressing problems in convexity theory and graph theory, which generalize well-known finite combinatorial problems. Such is the classification of continuous graph structures to “ransom” and “perfect” graphs.