PreprintCC BY 4.0arXiv
Geometric triangle-free graphs of large chromatic number
Abstract
We present several geometric constructions of graphs with rapidly growing chromatic numbers, most of which are triangle-free or have large girth.
Related
- Bounds for the Vertex Chromatic Number of Connected Triangle-Free Graphs
- Minimal Cayley graphs with large chromatic number
- Box-Delaunay graphs of large chromatic number
- The Game Chromatic Number of Complete Multipartite Graphs with Singletons and Large Parts
- Bounded chromatic number of graphs with small clique number and large minimum degree
BibTeX
@misc{tomon2026geometric,
title = {{Geometric triangle-free graphs of large chromatic number}},
author = {István Tomon},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.03517},
eprint = {2610.03517},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.03517},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Geometric triangle-free graphs of large chromatic number
AU - István Tomon
PY - 2026
DA - 2026/10/06
PB - arXiv
DO - 10.48550/arxiv.2610.03517
UR - https://arxiv.org/abs/2610.03517
AB - We present several geometric constructions of graphs with rapidly growing chromatic numbers, most of which are triangle-free or have large girth.
ER -