Descriptive Chromatic Numbers of Locally Finite and Everywhere Two Ended Graphs release_5nrakc3yave45jlmhlpjwccg5i

by Felix Weilacher

Released as a article .

2020  

Abstract

We construct Borel graphs which settle several questions in descriptive graph combinatorics. These include "Can the Baire measurable chromatic number of a locally finite Borel graph exceed the usual chromatic number by more than one?" and "Can marked groups with isomorphic Cayley graphs have Borel chromatic numbers for their shift graphs which differ by more than one?" We also provide a new bound for Borel chromatic numbers of graphs whose connected components all have two ends.
In text/plain format

Archived Files and Locations

application/pdf  369.8 kB
file_v63uqntlxjcv3bxhzcao4vurri
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-04-05
Version   v1
Language   en ?
arXiv  2004.02316v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 2d12e31d-3ca3-4b34-912c-b9986149a810
API URL: JSON