Descriptive chromatic numbers of locally finite and everywhere two-ended graphs

DOI10.4171/GGD/643MaRDI QIDQ2141707

Felix Weilacher

Publication date: 25 May 2022

Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.02316

zbMATH Keywords

descriptive graph combinatorics

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Definable Kőnig theorems

Cites Work

• Unnamed Item
• Ends of graphed equivalence relations. I
• Borel chromatic numbers
• Hyperfiniteness and Borel combinatorics
• A bound on measurable chromatic numbers of locally finite Borel graphs
• A determinacy approach to Borel combinatorics
• Marked groups with isomorphic Cayley graphs but different Borel combinatorics

This page was built for publication: Descriptive chromatic numbers of locally finite and everywhere two-ended graphs