arXiv:1502.02070 [math.CO]AbstractReferencesReviewsResources
Ball packings with high chromatic numbers from strongly regular graphs
Published 2015-02-06Version 1
Inspired by Bodarenko's counter-example to Borsuk's conjecture, we notice some strongly regular graphs that provide examples of ball packings whose chromatic numbers is significantly higher than the dimension. In particular, we obtain from generalized quadrangles the first non-constant lower bound for the difference between the chromatic number and the dimension.
Comments: 4 pages, note
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1810.06660 [math.CO] (Published 2018-10-15)
The chromatic index of strongly regular graphs
arXiv:2010.00580 [math.CO] (Published 2020-10-01)
Ball packings for links
Pseudocyclic association schemes and strongly regular graphs