Skip to main content
Download PDF
- Main
1,2,3,...,2n+1, infinity!
- Palamourdas, Konstantinos
- Advisor(s): Neeman, Itay
Abstract
It is well known that the Borel chromatic number of a graph generated by a Borel function is omega or at most 3. In this dissertation we will prove that the Borel chromatic number of a graph generated by $n$ Borel functions that commute is omega or at most 2n+1. On top of that, we will prove that the Borel chromatic number for graphs generated by 2 functions is omega or at most 2*2 + 1 = 5, while the Borel chromatic number for graphs generated by 3 functions is omega or at most 8.
Main Content
For improved accessibility of PDF content, download the file to your device.
If you recently published or updated this item, please wait up to 30 minutes for the PDF to appear here.
Enter the password to open this PDF file:
File name:
-
File size:
-
Title:
-
Author:
-
Subject:
-
Keywords:
-
Creation Date:
-
Modification Date:
-
Creator:
-
PDF Producer:
-
PDF Version:
-
Page Count:
-
Page Size:
-
Fast Web View:
-
Preparing document for printing…
0%