@article{Raig2000,
  author  = {Raigorodskii, A. M.},
  title   = {On the chromatic number of a space},
  journal = {Russian Mathematical Surveys},
  volume  = {55},
  year    = {2000},
  pages   = {351--352},
  doi     = {10.1070/RM2000v055n02ABEH000281},
}

@article{LR1972,
  author  = {Larman, D. G. and Rogers, C. A.},
  title   = {The realization of distances within sets in {E}uclidean space},
  journal = {Mathematika},
  volume  = {19},
  year    = {1972},
  pages   = {1--24},
  doi     = {10.1112/S0025579300004903},
}

@article{FW1981,
  author  = {Frankl, P. and Wilson, R. M.},
  title   = {Intersection theorems with geometric consequences},
  journal = {Combinatorica},
  volume  = {1},
  year    = {1981},
  pages   = {357--368},
}

@article{CKR2018,
  author     = {Cherkashin, D. and Kulikov, A. and Raigorodskii, A.},
  title      = {On the chromatic numbers of small-dimensional {E}uclidean spaces},
  journal    = {Discrete Applied Mathematics},
  volume     = {243},
  year       = {2018},
  pages      = {125--131},
  doi        = {10.1016/j.dam.2018.02.005},
  eprint     = {1512.03472},
  eprinttype = {arxiv},
}

@article{BR2019,
  author  = {Bogolyubsky, L. I. and Raigorodskii, A. M.},
  title   = {A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics {$\ell_1$} and {$\ell_2$}},
  journal = {Mathematical Notes},
  volume  = {105},
  number  = {1--2},
  year    = {2019},
  pages   = {180--203},
  doi     = {10.1134/S000143461901022X},
}

@article{BPT2015,
  author     = {Bachoc, C. and Passuello, A. and Thiery, A.},
  title      = {The density of sets avoiding distance 1 in {E}uclidean space},
  journal    = {Discrete \& Computational Geometry},
  volume     = {53},
  number     = {4},
  year       = {2015},
  pages      = {783--808},
  doi        = {10.1007/s00454-015-9668-z},
  eprint     = {1401.6140},
  eprinttype = {arxiv},
}

@online{BCL2026,
  author     = {Balogh, J. and Chen, C. and Li, B.},
  title      = {Forbidding exactly one {H}amming distance},
  year       = {2026},
  eprint     = {2604.05607},
  eprinttype = {arxiv},
}

@online{Davies2026,
  author     = {Davies, J.},
  title      = {Measurable obstructions for unmeasurable colourings},
  year       = {2026},
  eprint     = {2610.12301},
  eprinttype = {arxiv},
}

@article{dBE1951,
  author  = {de Bruijn, N. G. and Erd\H{o}s, P.},
  title   = {A colour problem for infinite graphs and a problem in the theory of relations},
  journal = {Indagationes Mathematicae},
  volume  = {13},
  year    = {1951},
  pages   = {371--373},
}

@article{EKR1961,
  author  = {Erd\H{o}s, P. and Ko, C. and Rado, R.},
  title   = {Intersection theorems for systems of finite sets},
  journal = {The Quarterly Journal of Mathematics},
  volume  = {12},
  year    = {1961},
  pages   = {313--320},
  doi     = {10.1093/qmath/12.1.313},
}

@article{Lovasz1978,
  author  = {Lov{\'a}sz, L.},
  title   = {Kneser's conjecture, chromatic number, and homotopy},
  journal = {Journal of Combinatorial Theory, Series A},
  volume  = {25},
  year    = {1978},
  pages   = {319--324},
  doi     = {10.1016/0097-3165(78)90022-5},
}

@article{Schrijver2005,
  author  = {Schrijver, A.},
  title   = {New code upper bounds from the {T}erwilliger algebra and semidefinite programming},
  journal = {IEEE Transactions on Information Theory},
  volume  = {51},
  year    = {2005},
  pages   = {2859--2866},
  doi     = {10.1109/TIT.2005.851748},
}

@book{SU1997,
  author    = {Scheinerman, E. R. and Ullman, D. H.},
  title     = {Fractional Graph Theory: A Rational Approach to the Theory of Graphs},
  publisher = {John Wiley \& Sons},
  year      = {1997},
}

@online{EI2014,
  author     = {Exoo, G. and Ismailescu, D.},
  title      = {On the chromatic number of {$\mathbb{R}^n$} for small values of {$n$}},
  year       = {2014},
  eprint     = {1408.2002},
  eprinttype = {arxiv},
}

@article{KJ2007,
  author  = {Konc, J. and Jane{\v z}i{\v c}, D.},
  title   = {An improved branch and bound algorithm for the maximum clique problem},
  journal = {MATCH Commun. Math. Comput. Chem.},
  volume  = {58},
  year    = {2007},
  pages   = {569--590},
}

@article{OLRS2011,
  author  = {Ostrowski, J. and Linderoth, J. and Rossi, F. and Smriglio, S.},
  title   = {Orbital branching},
  journal = {Mathematical Programming},
  volume  = {126},
  year    = {2011},
  pages   = {147--178},
  doi     = {10.1007/s10107-009-0273-x},
}

@article{Delsarte1973,
  author  = {Delsarte, P.},
  title   = {An algebraic approach to the association schemes of coding theory},
  journal = {Philips Research Reports Supplements},
  volume  = {10},
  year    = {1973},
}

@thesis{Pass2013,
  author      = {Passuello, A.},
  title       = {Semidefinite programming in combinatorial optimization with applications to coding theory and geometry},
  type        = {phdthesis},
  institution = {Universit{\'e} Bordeaux I},
  year        = {2013},
  url         = {https://theses.hal.science/tel-00948055/},
}

@article{LJM2017,
  author  = {Li, C.-M. and Jiang, H. and Many{\`a}, F.},
  title   = {On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem},
  journal = {Computers \& Operations Research},
  volume  = {84},
  year    = {2017},
  pages   = {1--15},
  doi     = {10.1016/j.cor.2017.02.017},
}

@report{NO2003,
  author      = {Niskanen, S. and {\"O}sterg{\aa}rd, P. R. J.},
  title       = {Cliquer user's guide, version 1.0},
  type        = {Tech. Rep.},
  number      = {T48},
  institution = {Communications Laboratory, Helsinki University of Technology},
  location    = {Espoo, Finland},
  year        = {2003},
}

@online{KT2014,
  author     = {Kahle, M. and Taha, B.},
  title      = {New lower bounds on {$\chi(\mathbb{R}^d)$} for {$d=8\dots 12$}},
  year       = {2014},
  eprint     = {1409.1278},
  eprinttype = {arxiv},
  note       = {Journal version: Geombinatorics 24 (2015), no. 3, pp. 109--116},
}

@online{Parts2026,
  author     = {Parts, J.},
  title      = {The chromatic number of {$\mathbb{R}^8$} is at least 25},
  year       = {2026},
  eprint     = {2603.14581},
  eprinttype = {arxiv},
}

@article{RSM2025,
  author  = {Raigorodskii, A. M. and Sinelnikov-Murylev, P. S.},
  title   = {Johnson graphs, their random subgraphs, and some of their extremal characteristics},
  journal = {Russian Mathematical Surveys},
  volume  = {80},
  number  = {3},
  year    = {2025},
  pages   = {471--530},
  doi     = {10.4213/rm10233e},
}

@online{Poly16,
  author  = {Mixon, D. G.},
  title   = {Polymath16, eighteenth thread: Back with a new conjecture!},
  date    = {2026-01-17},
  url     = {https://dustingmixon.wordpress.com/2026/01/17/polymath16-eighteenth-thread-back-with-a-new-conjecture/},
  urldate = {2026-07-16},
  note    = {Blog post with comment thread; the comments cited are the one
             dated 2026-03-08, permalink anchor \#comment-55671, and the
             exchange at \#comment-55677 to \#comment-55690},
}

@inproceedings{EN2018,
  author    = {Elffers, J. and Nordstr{\"o}m, J.},
  title     = {Divide and conquer: Towards faster pseudo-{B}oolean solving},
  booktitle = {Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence ({IJCAI}~'18)},
  year      = {2018},
  pages     = {1291--1299},
  doi       = {10.24963/ijcai.2018/180},
}

@article{BGMN2023,
  author  = {Bogaerts, B. and Gocht, S. and McCreesh, C. and Nordstr{\"o}m, J.},
  title   = {Certified dominance and symmetry breaking for combinatorial optimisation},
  journal = {Journal of Artificial Intelligence Research},
  volume  = {77},
  year    = {2023},
  pages   = {1539--1589},
  doi     = {10.1613/jair.1.14296},
  addendum = {Preliminary version: ``Certified symmetry and dominance breaking
             for combinatorial optimisation'', Proceedings of the AAAI
             Conference on Artificial Intelligence 36 (2022), no. 4,
             pp. 3698--3707, DOI 10.1609/aaai.v36i4.20283},
}

@inproceedings{GMMNPT2020,
  author    = {Gocht, S. and McBride, R. and McCreesh, C. and Nordstr{\"o}m, J. and Prosser, P. and Trimble, J.},
  title     = {Certifying solvers for clique and maximum common (connected) subgraph problems},
  booktitle = {Proceedings of the 26th International Conference on Principles and Practice of Constraint Programming ({CP}~'20)},
  series    = {Lecture Notes in Computer Science},
  volume    = {12333},
  year      = {2020},
  pages     = {338--357},
  doi       = {10.1007/978-3-030-58475-7_20},
}

@article{SSFAP2023,
  author  = {San Segundo, P. and Furini, F. and {\'A}lvarez, D. and Pardalos, P.},
  title   = {{CliSAT}: A new exact algorithm for hard maximum clique problems},
  journal = {European Journal of Operational Research},
  volume  = {307},
  number  = {3},
  year    = {2023},
  pages   = {1008--1025},
  doi     = {10.1016/j.ejor.2022.10.028},
}

@online{dG2018,
  author     = {de Grey, A. D. N. J.},
  title      = {The chromatic number of the plane is at least 5},
  year       = {2018},
  eprint     = {1804.02385},
  eprinttype = {arxiv},
}

@article{Brelaz1979,
  author  = {Br{\'e}laz, D.},
  title   = {New methods to color the vertices of a graph},
  journal = {Communications of the ACM},
  volume  = {22},
  number  = {4},
  year    = {1979},
  pages   = {251--256},
  doi     = {10.1145/359094.359101},
}

@inproceedings{McCreeshPT2020,
  author    = {McCreesh, C. and Prosser, P. and Trimble, J.},
  title     = {The {G}lasgow {S}ubgraph {S}olver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants},
  booktitle = {{ICGT} 2020},
  year      = {2020},
  pages     = {316--324},
}

@manual{RCore2026,
  author       = {{R Core Team}},
  title        = {R: A Language and Environment for Statistical Computing},
  organization = {R Foundation for Statistical Computing},
  address      = {Vienna, Austria},
  year         = {2026},
  doi          = {10.32614/R.manuals},
  url          = {https://www.R-project.org/},
}

@online{VeriPBdoc,
  author  = {Anders, M. and Bogaerts, B. and Bog{\o}, B. and Gontier, A. and Koops, W.
             and McCreesh, C. and Myreen, M. O. and Nordstr{\"o}m, J. and
             Rebola-Pardo, A. and Oertel, A. and Tan, Y. K.},
  title   = {Documentation of {VeriPB} and {CakePB} for the {SAT} {C}ompetition 2026},
  date    = {2026-03-20},
  url     = {https://satcompetition.github.io/2026/downloads/checkers/veripb.pdf},
}

@online{GlasgowDoc,
  title   = {Glasgow Subgraph Solver},
  date    = {2026-06-19},
  url     = {https://github.com/ciaranm/glasgow-subgraph-solver},
  note    = {Source repository at the revision of 2026-06-19, with its README and
             proof-logging documentation},
}