ejc-ds1-small-ramsey-numbers:
  string: "Small Ramsey Numbers, Stanis\u0142aw Radziszowski, 2024-09-06"
  date: '2024-09-06'
  doi: https://doi.org/10.37236/21
ejc-ds7-packing-unit-squares:
  string: 'Packing Unit Squares in Squares: A Survey and New Results, Erich Friedman,
    2009-08-14'
  date: '2009-08-14'
  doi: https://doi.org/10.37236/28
ejc-ds16-cages:
  string: Dynamic Cage Survey, Geoffrey Exoo and Robert Jajcay, 2013-07-26
  date: '2013-07-26'
  doi: https://doi.org/10.37236/37
oeis-A060843:
  string: Sequence A060843 in the OEIS
  date: '2024'
  url: https://oeis.org/A060843
oeis-A028444:
  string: Sequence A028444 in the OEIS
  date: '2011'
  url: https://oeis.org/A028444
aaronson-2020:
  string: The Busy Beaver Frontier, Scott Aaronson, 2020-09-29
  date: '2020-09-29'
  doi: https://doi.org/10.1145/3427361.3427369
wikipedia-kissing-number:
  string: Kissing number - Wikipedia
  date: '2025-01-21'
  url: https://en.wikipedia.org/wiki/Kissing_number
wikipedia-degree-diameter:
  string: Table of the largest known graphs of a given diameter and maximal degree
    - Wikipedia
  date: '2025-01-31'
  url: https://en.wikipedia.org/wiki/Table_of_the_largest_known_graphs_of_a_given_diameter_and_maximal_degree
combi-wiki-degree-diameter:
  string: The Degree Diameter Problem for General Graphs - Combinatorics Wiki
  date: '2022-02-18'
  url: http://combinatoricswiki.org/wiki/The_Degree_Diameter_Problem_for_General_Graphs
wikipedia-debruijn-newman:
  string: de Bruijn-Newman constant - Wikipedia
  date: '2025-02-04'
  url: https://en.wikipedia.org/wiki/De_Bruijn-Newman_constant
wikipedia-van-der-waerden:
  string: Van der Waerden number - Wikipedia
  date: '2025-01-26'
  url: https://en.wikipedia.org/wiki/Van_der_Waerden_number
wikipedia-cage:
  string: Cage (graph theory) - Wikipedia
  date: '2025-01-14'
  url: https://en.wikipedia.org/wiki/Cage_(graph_theory)
friedman-circles-in-triangles:
  string: Circles in Triangles, Erich Friedman
  date: '2002-07-19'
  url: https://erich-friedman.github.io/packing/cirintri/
friedman-circles-covering-circles:
  string: Circles Covering Circles, Erich Friedman
  date: '2019-08-16'
  url: https://erich-friedman.github.io/packing/circovcir/
wikipedia-disk-covering:
  string: Disk covering problem - Wikipedia
  date: '2025-01-21'
  url: https://en.wikipedia.org/wiki/Disk_covering_problem
oeis-a000136-stamp-folding:
  string: Number of ways of folding a strip of n labeled stamps. - OEIS
  date: '2025-02-16'
  url: https://oeis.org/A000136
oeis-a001418-map-folding-n-n:
  string: Number of ways of folding an n X n sheet of stamps. - OEIS
  date: '2025-02-16'
  url: https://oeis.org/A001418
oeis-a001415-map-folding-2-n:
  string: Number of ways of folding a 2 X n strip of stamps. - OEIS
  date: '2025-02-16'
  url: https://oeis.org/A001415
egan-superpermutations:
  string: Superpermutations - Greg Egan
  date: '2019-06-13'
  url: https://www.gregegan.net/SCIENCE/Superpermutations/Superpermutations.html
trivial:
  string: Trivial or easy according to the secondary source.
greenwood-gleason-1955:
  string: R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs,
    Canadian Journal of Mathematics, 7 (1955) 1-7.
  date: '1955'
  doi: https://doi.org/10.4153/CJM-1955-001-4
  notes: '[GG] in https://doi.org/10.37236/21'
kery-1964:
  string: "G. K\xE9ry, On a Theorem of Ramsey (in Hungarian), Matematikai Lapok, 15\
    \ (1964) 204-224."
  date: '1964'
  notes: "[K\xE9ry] in https://doi.org/10.37236/28"
kalbfleisch-1966:
  string: J.G. Kalbfleisch, Chromatic Graphs and Ramsey's Theorem, Ph.D. thesis, University
    of Waterloo, January 1966.
  date: 1966-01
  notes: '[Ka2] in https://doi.org/10.37236/28'
graver-yackel-1968:
  string: J.E. Graver and J. Yackel, Some Graph Theoretic Results Associated with
    Ramsey's Theorem, Journal of Combinatorial Theory, 4 (1968) 125-175.
  date: '1968'
  notes: '[GrY] in https://doi.org/10.37236/28'
grinstead-roberts-1982:
  string: C. Grinstead and S. Roberts, On the Ramsey Numbers R(3, 8) and R(3, 9),
    Journal of Combinatorial Theory, Series B, 33 (1982) 27-51.
  date: '1982'
  notes: '[GR] in https://doi.org/10.37236/28'
mckay-zhang-1992:
  string: B.D. McKay and Zhang Ke Min, The Value of the Ramsey Number R(3, 8), Journal
    of Graph Theory, 16 (1992) 99-105.
  date: '1992'
  notes: '[McZ] in https://doi.org/10.37236/28'
exoo-1989c:
  string: G. Exoo, On Two Classical Ramsey Numbers of the Form R(3, n), SIAM Journal
    on Discrete Mathematics, 2 (1989) 488-490.
  date: '1989'
  notes: '[Ex5] in https://doi.org/10.37236/28'
angeltveit-2024:
  string: "V. Angeltveit, R(3, 10) \u2264 41, manuscript (2024)."
  date: '2024'
  notes: '[Ang] in https://doi.org/10.37236/28'
exoo-2013:
  string: 'G. Exoo, On Some Small Classical Ramsey Numbers, Electronic Journal of
    Combinatorics, http://www.combinatorics.org, #P68, 20(1) (2013), 6 pages.'
  date: '2013'
  notes: '[Ex20] in https://doi.org/10.37236/28'
goedgebeur-radziszowski-2013:
  string: 'J. Goedgebeur and S.P. Radziszowski, New Computational Upper Bounds for
    Ramsey Numbers R(3, k), Electronic Journal of Combinatorics, http://www.combinatorics.org,
    #P30, 20(1) (2013), 28 pages.'
  date: '2013'
  notes: '[GoeR1] in https://doi.org/10.37236/28'
kolodyazhny-2015:
  string: M. Kolodyazhny, Novye Nizhnie Granitsy Chisel Ramseya R(3, 12) i R(3, 13)
    (in Russian), Matematicheskoye i Informacionnoe Modelirovanie, Tyumen, 14 (2015)
    126-130.
  date: '2015'
  notes: '[Kol1] in https://doi.org/10.37236/28'
lesser-2001:
  string: A. Lesser, Theoretical and Computational Aspects of Ramsey Theory, Examensarbeten
    i Matematik, Matematiska Institutionen, Stockholms Universitet, 3, http://www2.math.su.se/gemensamt/grund/exjobb/matte/2001
    (2001).
  date: '2001'
  notes: '[Les] in https://doi.org/10.37236/28'
kolodyazhny-2016:
  string: M. Kolodyazhny, graphs available at http://aluarium.net/forum/wiki-article-17.html,
    personal communication (2016).
  date: '2016'
  notes: '[Kol2] in https://doi.org/10.37236/28'
kalbfleisch-1965:
  string: J.G. Kalbfleisch, Construction of Special Edge-Chromatic Graphs, Canadian
    Mathematical Bulletin, 8 (1965) 575-584.
  date: '1965'
  notes: '[Ka1] in https://doi.org/10.37236/28'
mckay-radziszowski-1995:
  string: B.D. McKay and S.P. Radziszowski, R(4, 5) = 25, Journal of Graph Theory,
    19 (1995) 309-322.
  date: '1995'
  notes: '[MR4] in https://doi.org/10.37236/28'
exoo-2012:
  string: 'G. Exoo, On the Ramsey Number R(4, 6), Electronic Journal of Combinatorics,
    http://www.combinatorics.org, #P66, 19(1) (2012), 5 pages.'
  date: '2012'
  notes: '[Ex19] in https://doi.org/10.37236/28'
mckay-radziszowski-1997:
  string: B.D. McKay and S.P. Radziszowski, Subgraph Counting Identities and Ramsey
    Numbers, Journal of Combinatorial Theory, Series B, 69 (1997) 193-209.
  date: '1997'
  notes: '[MR5] in https://doi.org/10.37236/28'
exoo-1989a:
  string: G. Exoo, Applying Optimization Algorithm to Ramsey Problems, in Graph Theory,
    Combinatorics, Algorithms, and Applications (Y. Alavi ed.), SIAM Philadelphia,
    (1989) 175-179.
  date: '1989'
  notes: '[Ex3] in https://doi.org/10.37236/28'
mackey-1994:
  string: J. Mackey, Combinatorial Remedies, Ph.D. thesis, Department of Mathematics,
    University of Hawaii, 1994.
  date: '1994'
  notes: '[Mac] in https://doi.org/10.37236/28'
exoo-2005:
  string: G. Exoo, Indiana State University, personal communication (2005-2006). Constructions
    available at http://cs.indstate.edu/ge/RAMSEY.
  date: '2005'
  notes: '[Ex16] in https://doi.org/10.37236/28'
harborth-krause-2003:
  string: H. Harborth and S. Krause, Ramsey Numbers for Circulant Colorings, Congressus
    Numerantium, 161 (2003) 139-150.
  date: '2003'
  notes: '[HaKr1] in https://doi.org/10.37236/28'
exoo-tatarevic-2015:
  string: 'G. Exoo and M. Tatarevic, New Lower Bounds for 28 Classical Ramsey Numbers,
    Electronic Journal of Combinatorics, http:// www.combinatorics.org, #P3.11, 22(3)
    (2015), 12 pages. Graphs available at the journal site and at http://cs.indstate.edu/ge/RAMSEY/ExTa.'
  date: '2015'
  notes: '[ExT] in https://doi.org/10.37236/28'
spencer-1994:
  string: T. Spencer, University of Nebraska at Omaha, personal communication (1993),
    and, Upper Bounds for Ramsey Numbers via Linear Programming, manuscript (1994).
  date: '1994'
  notes: '[Spe4] in https://doi.org/10.37236/28'
su-luo-li-1998:
  string: Su Wenlong, Luo Haipeng and Li Qiao, New Lower Bounds of Classical Ramsey
    Numbers R(4, 12), R(5, 11) and R(5, 12), Chinese Science Bulletin, 43, 6 (1998)
    528.
  date: '1998'
  notes: '[SuLL] in https://doi.org/10.37236/28'
tatarevic-2020:
  string: M. Tatarevic, personal communication, graph constructions for lower bounds
    on Ramsey numbers at http://github.com/milostatarevic/ramsey-numbers/tree/master/graphs
    (2020).
  date: '2020'
  notes: '[Tat] in https://doi.org/10.37236/28'
exoo-1989b:
  string: G. Exoo, A Lower Bound for R(5, 5), Journal of Graph Theory, 13 (1989) 97-98.
  date: '1989'
  notes: '[Ex4] in https://doi.org/10.37236/28'
angeltveit-mckay-2018:
  string: "V. Angeltveit and B.D. McKay, R(5, 5 ) \u2264 48, Journal of Graph Theory,\
    \ 89 (2018) 5-13."
  date: '2018'
  notes: '[AnM1] in https://doi.org/10.37236/28'
exoo-2023:
  string: G. Exoo, Indiana State University, A Lower Bound for R(5, 6), manuscript
    (2023).
  date: '2023'
  notes: '[Ex25] in https://doi.org/10.37236/28'
huang-zhang-1993:
  string: Huang Yi Ru and Zhang Ke Min, A New Upper Bound Formula on Ramsey Numbers,
    Journal of Shanghai University, Natural Science, 7 (1993) 1-3.
  date: '1993'
  notes: '[HZ1] in https://doi.org/10.37236/28'
calkin-erdos-tovey-1997:
  string: "N.J. Calkin, P. Erd\u0151s and C.A. Tovey, New Ramsey Bounds from Cyclic\
    \ Graphs of Prime Order, SIAM Journal on Discrete Mathematics, 10 (1997) 381-387."
  date: '1997'
  notes: '[CaET] in https://doi.org/10.37236/28'
kuznetsov-2016:
  string: E. Kuznetsov, Computational Lower Limits on Small Ramsey Numbers, preprint,
    arXiv, http://arxiv.org/abs/1505.07186 (2016).
  date: '2016'
  notes: '[Kuz] in https://doi.org/10.37236/28'
huang-w-s-y-z-h-2007:
  string: Huang Yi Ru, Wang Yuandi, Sheng Wancheng, Yang Jiansheng, Zhang Ke Min and
    Huang Jian, New Upper Bound Formulas with Parameters for Ramsey Numbers, Discrete
    Mathematics, 307 (2007) 760-763.
  date: '2007'
  notes: '[HWSYZH] or [HW+] in https://doi.org/10.37236/28'
mathon-1987:
  string: R. Mathon, Lower Bounds for Ramsey Numbers and Association Schemes, Journal
    of Combinatorial Theory, Series B, 42 (1987) 122-127.
  date: '1987'
  notes: '[Math] in https://doi.org/10.37236/28'
huang-zhang-1998:
  string: Huang Yi Ru and Zhang Ke Min, An New Upper Bound Formula for Two Color Classical
    Ramsey Numbers, Journal of Combinatorial Mathematics and Combinatorial Computing,
    28 (1998) 347-350.
  date: '1998'
  notes: '[HZ2] in https://doi.org/10.37236/28'
xu-xie-e-r-2004:
  string: 'Xu Xiaodong, Xie Zheng, G. Exoo and S.P. Radziszowski, Constructive Lower
    Bounds on Classical Multicolor Ramsey Numbers, Electronic Journal of Combinatorics,
    http://www.combinatorics.org, #R35, 11(1) (2004), 24 pages.'
  date: '2004'
  notes: '[XXER] in https://doi.org/10.37236/28'
xiaodong-s-r-2011:
  string: Xiaodong Xu, Zehui Shao and S.P. Radziszowski, More Constructive Lower Bounds
    on Classical Ramsey Numbers, SIAM Journal on Discrete Mathematics, 25 (2011) 394-400.
  date: '2011'
  notes: '[XSR2] in https://doi.org/10.37236/28'
xu-xie-radziszowski-2004:
  string: Xu Xiaodong, Xie Zheng and S.P. Radziszowski, A Constructive Approach for
    the Lower Bounds on the Ramsey Numbers R(s, t), Journal of Graph Theory, 47 (2004)
    231-239.
  date: '2004'
  notes: '[XuXR] in https://doi.org/10.37236/28'
burling-reyner-1972:
  string: J.P. Burling and S.W. Reyner, Some Lower Bounds of the Ramsey Numbers n(k,
    k), Journal of Combinatorial Theory, Series B, 13 (1972) 168-169.
  date: '1972'
  notes: '[BurR] in https://doi.org/10.37236/28'
shi-zhang-2001:
  string: Shi Ling Sheng and Zhang Ke Min, An Upper Bound Formula for Ramsey Numbers,
    manuscript (2001).
  date: '2001'
  notes: '[ShZ1] in https://doi.org/10.37236/28'
shi-2003:
  string: Lingsheng Shi, Upper Bounds for Ramsey Numbers, Discrete Mathematics, 270
    (2003) 251-265.
  date: '2003'
  notes: '[Shi2] in https://doi.org/10.37236/28'
angeltveit-mckay-2019-2024:
  string: V. Angeltveit and B.D. McKay, personal communication (2019-2024).
  date: '2020'
  notes: '[AnM2] and [AnM3] in https://doi.org/10.37236/28'
gobel-1979:
  string: "F. G\xF6bel, Geometrical Packing and Covering Problems, in Packing and\
    \ Covering in Combinatorics, A. Schrijver (ed.), Math Centrum Tracts 106 (1979)\
    \ 179-199."
  date: '1979'
  notes: '[7] in https://doi.org/10.37236/28'
lin-1965:
  string: Shen Lin and Tibor Rado. 1965. Computer Studies of Turing Machine Problems.
    J. ACM 12, 2 (April 1965), 196-212.
  date: '1965-04-01'
  doi: https://doi.org/10.1145/321264.321270
brady-1983:
  string: "Brady, A. H. (1983). The determination of the value of Rado's noncomputable\
    \ function \u03A3(k) for four-state Turing machines. Mathematics of Computation,\
    \ 40(162), 647-665."
  date: 1983-04
  doi: https://doi.org/10.1090/S0025-5718-1983-0689479-6
marxen-1990:
  string: Marxen, H., & Buntrock, J. (1990). Attacking the busy beaver 5. Bulletin
    of the EATCS, 40, 247-251.
  date: 1990-02
kropitz-2011:
  string: "Kropitz, P. (2011). Probl\xE9m busy beaver."
  date: '2011'
  url: https://dspace.cuni.cz/handle/20.500.11956/37142?show=full
loz-siran-2008:
  string: "Loz, E., & Sir\xE1n, J. (2008). New record graphs in the degree-diameter\
    \ problem. Australasian Journal of Combinatorics, 41, 63."
  date: '2008'
  url: https://ajc.maths.uq.edu.au/pdf/41/ajc_v41_p063.pdf
jianxiang-chen-2018:
  string: Jianxiang Chen, 2018
  date: '2018'
conder-2006:
  string: Conder, M. (2006). Trivalent (cubic) symmetric graphs on up to 2048 vertices.
  date: '2006-08-17'
  url: https://www.math.auckland.ac.nz/~conder/symmcubic2048list.txt
comellas-gomez-1994:
  string: "Comellas, F., & G\xF3mez, J. (1994). New large graphs with given degree\
    \ and diameter. arXiv preprint math/9411218."
  date: '1994-11-03'
  doi: https://doi.org/10.48550/arXiv.math/9411218
  url: https://arxiv.org/abs/math/9411218
sampels-1997:
  string: "Sampels, M. (1997). Large networks with small diameter. In: M\xF6hring,\
    \ R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1997. Lecture Notes\
    \ in Computer Science, vol 1335. Springer, Berlin, Heidelberg."
  date: '1997'
  doi: https://doi.org/10.1007/BFb0024505
dinneen-hafner-1994:
  string: Dinneen, M. J., & Hafner, P. R. (1994). New results for the degree/diameter
    problem. Networks, 24(7), 359-367.
  date: 1994-10
  doi: https://doi.org/10.1002/net.3230240702
pelakhaty-2021:
  string: Vlad Pelakhaty, 2021
  date: '2021'
canale-2012:
  string: Eduardo A. Canale, 2012
  date: '2012'
abas-2016:
  string: Abas, M. (2016). Cayley graphs of diameter two with order greater than 0.684
    of the Moore bound for any degree. European Journal of Combinatorics, 57, 109-120.
  date: 2016-10
  doi: https://doi.org/10.1016/j.ejc.2016.04.008
elspasgraphs:
  string: Elspas, B. (1964, November). Topological constraints on interconnection-limited
    logic. In 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit
    Theory and Logical Design (pp. 133-137). IEEE.
  date: 1964-11
  doi: https://doi.org/10.1109/SWCT.1964.27
dotygraph:
  string: Doty, Karl (1982), Large regular interconnection networks, Proceedings of
    the 3rd International Conference on Distributed Computing Systems, IEEE Computer
    Society, pp. 312-317
  date: 1982-10
buset-2000:
  string: Buset, D. (2000). Maximal cubic graphs with diameter 4. Discrete applied
    mathematics, 101(1-3), 53-61.
  date: '2000-04-15'
  doi: https://doi.org/10.1016/S0166-218X(99)00204-8
afygraph:
  string: Alegre, I., Fiol, M. A., & Yebra, J. L. A. (1986). Some large graphs with
    given degree and diameter. Journal of graph theory, 10(2), 219-224.
  date: '1986'
  doi: https://doi.org/10.1002/jgt.3190100211
exoographs:
  string: Geoffrey Exoo, 1998 through 2010
exoo-post-2001:
  string: Geoffrey Exoo, after May 2001 (i.e. after https://doi.org/10.1002/jgt.1007)
  date: 2001-06
allwrightgraph:
  string: "Allwright, J. (1992). New (\u0394, D) graphs discovered by heuristic search.\
    \ Discrete Applied Mathematics, 37, 3-8."
  date: '1992-07-15'
  doi: https://doi.org/10.1016/0166-218X(92)90120-Y
delorme85agraphs:
  string: "Delorme, C. (1985). Grands graphes de degr\xE9 et diametre donn\xE9s. European\
    \ Journal of Combinatorics, 6(4), 291-302."
  date: 1985-12
  doi: https://doi.org/10.1016/S0195-6698(85)80043-3
delorme85bgraphs:
  string: Delorme, C. (1985). Large bipartite graphs with given degree and diameter.
    Journal of graph theory, 9(3), 325-334.
  date: '1985'
  doi: https://doi.org/10.1002/jgt.3190090304
pinedagraphs:
  string: "Pineda-Villavicencio, G., G\xF3mez, J., Miller, M., & P\xE9rez-Ros\xE9\
    s, H. (2006). New largest graphs of diameter 6: (Extended Abstract). Electronic\
    \ Notes in Discrete Mathematics, 24, 153-160."
  date: '2006-07-15'
  doi: https://doi.org/10.1016/j.endm.2006.06.044
wegnergraph:
  string: Wegner, G. (1977). Graphs with given diameter and a coloring problem.
  date: '1977'
  doi: http://dx.doi.org/10.17877/DE290R-16496
molodtsov-2006:
  string: Molodtsov, S. G. (2006). Largest graphs of diameter 2 and maximum degree
    6. General Theory of Information Transfer and Combinatorics, 853-857.
  date: '2006'
  doi: https://doi.org/10.1007/11889342_54
dfgraphs:
  string: "Delorme, & Farhi. (1984). Large graphs with given degree and diameter\u2014\
    Part I. IEEE transactions on computers, 100(9), 857-860."
  date: '1984-09-30'
  doi: https://doi.org/10.1109/TC.1984.1676504
bdfgraph:
  string: Bermond, J. C., Delorme, C., & Farhi, G. (1982). Large graphs with given
    degree and diameter III. In North-Holland Mathematics Studies (Vol. 62, pp. 23-31).
    North-Holland.
  date: '1982'
  doi: https://doi.org/10.1016/S0304-0208(08)73544-8
mmsgraphs:
  string: "McKay, B. D., Miller, M., & \u0160ir\xE1\u0148, J. (1998). A note on large\
    \ graphs of diameter two and given maximum degree. Journal of Combinatorial Theory,\
    \ Series B, 74(1), 110-118."
  date: 1998-09
  doi: https://doi.org/10.1006/jctb.1998.1828
comellasgraphs:
  string: Comellas, F. (2024). Table of large graphs with given degree and diameter.
    arXiv preprint arXiv:2406.18994.
  date: '2024-06-27'
  doi: https://doi.org/10.48550/arXiv.2406.18994
canale12graphs:
  string: "Canale, E., & Rodr\xEDguez, A. (2012). On the application of voltage graphs\
    \ to the degree/diameter problem."
  date: '2012-12-11'
  url: https://web.archive.org/web/20200928131319/http://premat.fing.edu.uy/papers/2013/153.pdf
storwickgraphs:
  string: Storwick, R. M. (1970). Improved construction techniques for (d, k) graphs.
    IEEE Transactions on Computers, 100(12), 1214-1216.
  date: '1970-12-31'
  doi: https://doi.org/10.1109/T-C.1970.222861
mitjana-comellas-1995:
  date: '1995'
  string: Margarida Mitjana and Francesc Comellas in 1995
gomez09graphs:
  string: "G\xF3mez, J. (2009), Some new large (\u0394, 3)-graphs. Networks, 53: 1-5."
  date: '2008-06-03'
  doi: https://doi.org/10.1002/net.20254
gomezfiolgraphs:
  string: "G\xF3mez, Jos\xE9; Fiol, Miquel (1985), Dense compound graphs, Ars Combinatoria,\
    \ 20: 211-237"
  date: '1985'
gfsgraphs:
  string: "G\xF3mez, J., Fiol, M. A., & Serra, O. (1993). On large (\u0394, D)-graphs.\
    \ Discrete Mathematics, 114(1-3), 219-235."
  date: '1993-04-28'
  doi: https://doi.org/10.1016/0012-365X(93)90368-4
exoo-2001:
  string: Exoo, G. (2001). A family of graphs and the degree/diameter problem. Journal
    of Graph Theory, 37(2), 118-124.
  date: '2001-05-25'
  doi: https://doi.org/10.1002/jgt.1007
brown-1966:
  string: Brown, W. G. (1966).
  date: '1966'
loz-pineda-2010:
  string: Loz, E., & Pineda-Villavicencio, G. (2010). New benchmarks for large-scale
    networks with given maximum degree and diameter. The Computer Journal, 53(7),
    1092-1105.
  date: 2010-09
  doi: https://doi.org/10.1093/comjnl/bxp091
csordas-norfolk-varga-1987:
  string: "Csordas, G., Norfolk, T. S., & Varga, R. S. (1987). A low bound for the\
    \ de Bruijn-newman constant \u039B. Numerische Mathematik, 52, 483-497."
  date: 1987-09
  doi: https://doi.org/10.1007/BF01400887
teriele-1990:
  string: te Riele, H. J. (1990). A new lower bound for the de Bruijn-Newman constant.
    Numerische Mathematik, 58, 661-667.
  date: 1990-12
  doi: https://doi.org/10.1007/BF01385647
csordas-ruttan-varga-1991:
  string: Csordas, G., Ruttan, A., & Varga, R. S. (1991). The Laguerre inequalities
    with applications to a problem associated with the Riemann hypothesis. Numerical
    Algorithms, 1(2), 305-329.
  date: 1991-06
  doi: https://doi.org/10.1007/BF02142328
csordas-o-s-v-1993:
  string: "Csordas, G., Odlyzko, A. M., Smith, W., & Varga, R. S. (1993). A new Lehmer\
    \ pair of zeros and a new lower bound for the de Bruijn-Newman constant \u039B\
    . Electronic Transactions on Numerical Analysis, 1, 104-111."
  date: 1993-12
  url: https://etna.ricam.oeaw.ac.at/volumes/1993-2000/vol1/abstract.php?vol=1&pages=104-111
odlyzko-2000:
  string: Odlyzko, A. M. (2000). An improved bound for the de Bruijn-Newman constant.
    Numerical Algorithms, 25, 293-303.
  date: 2000-09
  doi: https://doi.org/10.1023/A:1016677511798
saouter-gourdon-demichel-2011:
  string: Saouter, Y., Gourdon, X., & Demichel, P. (2011). An improved lower bound
    for the de Bruijn-Newman constant. Mathematics of Computation, 80(276), 2281-2287.
  date: '2011-03-09'
  doi: https://doi.org/10.1090/S0025-5718-2011-02472-5
rodgers-tao-2018:
  string: Rodgers, B., & Tao, T. (2020, January). The de Bruijn-Newman constant is
    non-negative. In Forum of Mathematics, Pi (Vol. 8, p. e6). Cambridge University
    Press.
  date: '2020-04-06'
  doi: https://doi.org/10.1017/fmp.2020.6
debruijn-1950:
  string: de Bruijn, N. G. (1950). The roots of trigonometric integrals. Duke Math.
    J., 17(1), 197-226.
  date: 1950-09
  doi: https://doi.org/10.1215/S0012-7094-50-01720-0
ki-kim-lee-2009:
  string: Ki, H., Kim, Y. O., & Lee, J. (2009). On the de Bruijn-Newman constant.
    Advances in Mathematics, 222(1), 281-306.
  date: '2009-09-10'
  doi: https://doi.org/10.1016/j.aim.2009.04.003
polymath-2019:
  string: "Polymath, D. H. J. (2019). Effective approximation of heat flow evolution\
    \ of the Riemann \u03BE function, and a new upper bound for the de Bruijn-Newman\
    \ constant. Research in the Mathematical Sciences, 6, 1-67."
  date: '2019-08-26'
  doi: https://doi.org/10.1007/s40687-019-0193-1
platt-trudgian-2020:
  string: "Platt, D., & Trudgian, T. (2021). The Riemann hypothesis is true up to\
    \ 3\xB7 10 12. Bulletin of the London Mathematical Society, 53(3), 792-797."
  date: '2021-01-22'
  doi: https://doi.org/10.1112/blms.12460
chvatal-1970:
  string: "Chv\xE1tal, V. (1970). Some unknown van der Waerden numbers. Combinatorial\
    \ structures and their applications, 31-33."
  date: '1970'
stevens-shantaram-1978:
  string: Stevens, R. S., & Shantaram, R. (1978). Computer-generated van der Waerden
    partitions. Mathematics of Computation, 32(142), 635-636.
  date: 1978-04
  doi: https://doi.org/10.1090/S0025-5718-1978-0491468-X
kouril-paul-2011:
  string: Kouril, M., & Paul, J. L. (2008). The van der Waerden number W (2, 6) is
    1132. Experimental Mathematics, 17(1), 53-61.
  date: '2011-01-30'
  doi: https://doi.org/10.1080/10586458.2008.10129025
kouril-pre-2011:
  string: Kouril, M. prior to 2011-01-30 (https://doi.org/10.1080/10586458.2008.10129025)
  date: '2011-01-29'
rabung-lotts-2012:
  string: Rabung, J., & Lotts, M. (2012). Improving the use of cyclic zippers in finding
    lower bounds for van der Waerden numbers. the electronic journal of combinatorics,
    P35-P35.
  date: '2012-06-06'
  doi: https://doi.org/10.37236/2363
kouril-2012:
  string: 'Kouril, Michal (2012). Computing the van der Waerden number W(3,4)=293.
    Integers. 12: A46.'
  date: '2012'
beeler-oneil-1979:
  string: Beeler, M. D., & O'neil, P. E. (1979). Some new van der Waerden numbers.
    Discrete Mathematics, 28(2), 135-146.
  date: '1979'
  doi: https://doi.org/10.1016/0012-365X(79)90090-6
rabung-1979:
  string: Rabung, J. R. (1979). Some progression-free partitions constructed using
    Folkman's method. Canadian Mathematical Bulletin, 22(1), 87-91.
  date: '1979-03-01'
  doi: https://doi.org/10.4153/CMB-1979-012-1
monroe-2019:
  string: Monroe, D. (2019). New Lower Bounds for van der Waerden Numbers Using Distributed
    Computing. arXiv preprint arXiv:1603.03301v6.
  date: '2019-05-22'
  doi: https://doi.org/10.48550/arXiv.1603.03301
heule-2017:
  string: Heule, M. J. (2017). Avoiding triples in arithmetic progression. Journal
    of Combinatorics, 8(3), 391-422.
  date: '2017-06-21'
  doi: https://dx.doi.org/10.4310/JOC.2017.v8.n3.a1
blankenship-c-t-2018:
  string: Blankenship, T., Cummings, J., & Taranchuk, V. (2018). A new lower bound
    for van der Waerden numbers. European Journal of Combinatorics, 69, 163-168.
  date: 2018-03
  doi: https://doi.org/10.1016/j.ejc.2017.10.007
araujopardo-2010:
  string: G. Araujo-Pardo, On upper bounds of odd girth cages, Discrete Math. 310
    (2010) 1622-1626.
  date: '2010'
exoo-circa-2008:
  string: G. Exoo, Regular graphs of given degree and girth.
  date: '2008'
  url: https://web.archive.org/web/20081011185526/http://ginger.indstate.edu/ge/CAGES/
exoo-circa-2012:
  string: G. Exoo, Regular graphs of given degree and girth.
  date: '2012'
  url: https://web.archive.org/web/20120316225548/http://ginger.indstate.edu/ge/CAGES/
bezdek-1983:
  string: "K\xE1roly Bezdek in 1983"
  date: '1983'
bezdek-1979:
  string: "K\xE1roly Bezdek in 1979"
  date: '1979'
toth-1996:
  string: "G\xE1bor Fejes T\xF3th in 1996"
  date: '1996'
toth-2005:
  string: "G\xE1bor Fejes T\xF3th in 2005"
  date: '2005'
melissen-1997:
  string: Hans Melissen in 1997
  date: '1997'
tan-2018:
  string: Jeremy Tan in 2018
  date: '2018'
milano-1987:
  string: Milano in 1987
  date: '1987'
oler-groemer-1961:
  string: Oler and Groemer in 1961
  date: '1961'
melissen-1993:
  string: Melissen, H. (1993). Densest packings of congruent circles in an equilateral
    triangle. The American Mathematical Monthly, 100(10), 916-925.
  date: 1993-12
  doi: https://doi.org/10.2307/2324212
melissen-1994a:
  string: Melissen, J. B. M. (1994). Optimal packings of eleven equal circles in an
    equilateral triangle. Acta Mathematica Hungarica, 65(4), 389-393.
  date: '1994-12-01'
  doi: https://doi.org/10.1007/bf01876040
melissen-1994b:
  string: Melissen in 1994
  date: '1994'
erdos-oler-1961:
  string: "Erd\u0151s and Oler in 1961"
  date: '1961'
erdos-groemer-1961:
  string: "Erd\u0151s and Groemer in 1961"
  date: '1961'
chaffin-2014:
  string: Ben Chaffin in 2014
  date: '2014'
houston-2014:
  string: Houston, R. (2014). Tackling the minimal superpermutation problem. arXiv
    preprint arXiv:1408.5108.
  date: '2014-08-21'
  doi: https://doi.org/10.48550/arXiv.1408.5108
coanda-2019:
  string: Charlie Vane (Bogdan Coanda) on 2019-02-01
  date: '2019-02-01'
houston-egan-2019:
  string: Robin Houston and Greg Egan on 2019-02-27
  date: '2019-02-27'
