Showing math.COShow all
2 papers · 1 filter
math.CO2024
The measurable Hall theorem fails for treeings
Gábor Kun
We construct, for every , a -regular acyclic measurably bipartite graphing that admits no measurable perfect matching, resolving a problem of Kechris and Marks. A dens…
math.CO2024
Posets are easily testable
Panna TÃmea Fekete, Gábor Kun
Alon and Shapira proved that every monotone class (closed under taking subgraphs) of undirected graphs is strongly testable, that is, under the promise that a given graph is either…