3 papers
math.PR2026
Thresholds for colouring the random Borsuk graph
Ãlvaro Acitores Montero, Matthias Irlbeck, Tobias Müller +1
We consider the chromatic number of the random Borsuk graph. The random Borsuk graph is obtained by sampling points i.i.d. uniformly at random on the -dimensional sphere $S^…
math.CO2026
A note on vertex-critical induced subgraphs of shift graphs
Tomáš Kaiser, MatÄj StehlÃk, Riste Å krekovski
Shift graphs, introduced by ErdÅs and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. I…
math.CO2025
Quadrangulations and the Lovász complex
Carmen Arana, MatÄj StehlÃk
The Lovász complex of a graph is a deformation retract of its neighborhood complex, equipped with a canonical -action. We show that, under mild assumptions, …