A natural question is which results from finite combinatorics have analogues ’definable’ (i.e., Borel, µ-measurable, \tau -Baire measurable) counterparts for Borel graphs.
Statement
A natural question is which results from finite combinatorics have analogues ’definable’ (i.e., Borel, µ-measurable, \tau -Baire measurable) counterparts for Borel graphs. Measurable combinatorics in hyperfinite graphs Matt Bowen (joint work with Gabor Kun and Marcin Sabok; Felix Weilacher; Antoine Poulin and Jenna Zomback) Theorem (B., Weilacher [4]). Let G be a bipartite Borel graph with maximum degree ∆(G). Then χ′BM (G) \leq ∆(G) + 1. If G is µ-hyperfinite then χ′µ (G) satisfies the same bound.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.