Thresholds for colouring the random Borsuk graph
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914377369649152 |
|---|---|
| author | Montero, Álvaro Acitores Irlbeck, Matthias Müller, Tobias Stehlík, Matěj |
| author_facet | Montero, Álvaro Acitores Irlbeck, Matthias Müller, Tobias Stehlík, Matěj |
| contents | We consider the chromatic number of the random Borsuk graph. The random Borsuk graph is obtained by sampling $n$ points i.i.d. uniformly at random on the $d$-dimensional sphere $S^d$, and joining a pair of points by an edge whenever their geodesic distance is $>π-α$ where the parameter $α=α(n)$ may depend on $n$. Kahle and Martinez-Figueroa have shown that the switch from being $(d+1)$-colourable to needing $\geq d+2$ colours occurs in the regime where the average degree is of logarithmic order. We show that for each $2\leq k\leq d$, the switch from being $k$-colourable to needing $> k$ colours occurs in the regime when the average degree is constant. What is more, we show that for $k=2$ there is a sharp threshold of the form $α(n) = c \cdot n^{-1/d}$, where the constant $c$ can be expressed in terms of the critical intensity for continuum AB percolation on $\mathbb{R}^d$. For $k=3,\dots,d+1$ we show that there is a sharp threshold for "almost all $n$". |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_05467 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Thresholds for colouring the random Borsuk graph Montero, Álvaro Acitores Irlbeck, Matthias Müller, Tobias Stehlík, Matěj Probability Combinatorics We consider the chromatic number of the random Borsuk graph. The random Borsuk graph is obtained by sampling $n$ points i.i.d. uniformly at random on the $d$-dimensional sphere $S^d$, and joining a pair of points by an edge whenever their geodesic distance is $>π-α$ where the parameter $α=α(n)$ may depend on $n$. Kahle and Martinez-Figueroa have shown that the switch from being $(d+1)$-colourable to needing $\geq d+2$ colours occurs in the regime where the average degree is of logarithmic order. We show that for each $2\leq k\leq d$, the switch from being $k$-colourable to needing $> k$ colours occurs in the regime when the average degree is constant. What is more, we show that for $k=2$ there is a sharp threshold of the form $α(n) = c \cdot n^{-1/d}$, where the constant $c$ can be expressed in terms of the critical intensity for continuum AB percolation on $\mathbb{R}^d$. For $k=3,\dots,d+1$ we show that there is a sharp threshold for "almost all $n$". |
| title | Thresholds for colouring the random Borsuk graph |
| topic | Probability Combinatorics |
| url | https://arxiv.org/abs/2603.05467 |