6 citations · 23 across the 15 of their papers we have counts for
9 papers · 1 filter
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…
On pattern-avoiding permutons
Frederik Garbe, Jan Hladký, Gábor Kun +1
The theory of limits of permutations leads to limit objects called permutons, which are certain Borel measures on the unit square. We prove that permutons avoiding a given permutat…
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…
Perfect matchings in hyperfinite graphings
Matthew Bowen, Gabor Kun, Marcin Sabok
We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particular, we prove that every regular hyperfinite bipartite graphing admits a measurab…
Expander spanning subgraphs with large girth
Itai Benjamini, Mikolaj Fraczyk, Gabor Kun
We conjecture that finite graphs with positive Cheeger constant admit a spanning subgraph with positive Cheeger constant and girth proportional to the diameter. We prove this conje…
On sofic approximations of Property (T) groups
Gabor Kun
We prove Bowen's conjecture that every sequence of finite graphs that locally converges to the Cayley graph of a countably infinite group with Kazhdan Property (T) is essentially a…