9 citations · 16 across the 9 of their papers we have counts for
11 papers
Measurable matchings in unbalanced graphs
Anton Bernshteyn, Matt Bowen, Felix Weilacher
Let be a locally finite multigraph that is bipartite and "unbalanced," meaning that it has a nontrivial bipartition with for all $x…
The uniform Gardner conjecture and rounding Borel flows
Matthew Bowen, Gábor Kun, Marcin Sabok
We study groups which satisfy Gardner's equidecomposition conjecture for uniformly distributed sets. We prove that an amenable group has this property if and only if it does not ad…
One-ended spanning trees and definable combinatorics
Matthew Bowen, Antoine Poulin, Jenna Zomback
Let be a Polish space with Borel probability measure and a locally finite one-ended Borel graph on We show that admits a Borel one-ended spanning tree gen…
Monochromatic products and sums in the rationals
Matt Bowen, Marcin Sabok
We show that for every coloring of the rationals into finitely many colors, one of the colors contains a set of the form for some nonzero and .
Composite Ramsey theorems via trees
Matt Bowen
We prove a theorem ensuring that the compositions of certain Ramsey families are still Ramsey. As an application, we show that in any finite coloring of there is an in…
Monochromatic products and sums in -colorings of
Matt Bowen
We show that any -coloring of contains infinitely many monochromatic sets of the form and more generally monochromatic sets of the form $\{x_i,\pr…
Definable Kőnig theorems
Matt Bowen, Felix Weilacher
Let be a Polish space with Borel probability measure and let be a Borel graph on with no odd cycles and maximum degree We show that the Baire measurable ed…
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…
Colored unavoidable patterns and balanceable graphs
Matt Bowen, Adriana Hansberg, Amanda Montejano +1
We study a Turán-type problem on edge-colored complete graphs. We show that for any and , any sufficiently large -edge-colored complete graph on vertices with $Ω(n^{2…
Finding unavoidable colorful patterns in multicolored graphs
Matthew Bowen, Ander Lamaison, Alp Müyesser
We provide multicolored and infinite generalizations for a Ramsey-type problem raised by Bollobás, concerning colorings of where each color is well-represented. Let be a…
The Sprague-Grundy function for some selective compound games
Calvin Beideman, Matthew Bowen, Necati Alp Muyesser
We analyze the Sprague-Grundy functions for a class of almost disjoint selective compound games played on Nim heaps. Surprisingly, we find that these functions behave chaotically f…