Definable matchings in o-minimal bipartite graphs

Abstract: This talk will revolve around the question, under what conditions an o-minimally definable bipartite graph admits a definable matching. We discuss some context, a partial result, and touch on possible applications. This is work in progress.

discrete mathematicscombinatoricslogic

Audience: researchers in the topic

Online logic seminar

Series comments: Description: Seminar on all areas of logic