Source ledger
References
837 bibliography records ground the catalog in original papers, established surveys and monographs, institutional problem lists, and formal-proof archives.
Complete bibliography
837 records
- Mattila1987SphericalAveragesOpen source ↗
Spherical averages of Fourier transforms of measures with finite energy; dimension of intersections and distance sets
Pertti Mattila · 1987 · misc
Pertti Mattila, “Spherical averages of Fourier transforms of measures with finite energy; dimension of intersections and distance sets,” Mathematika 34 (1987), 207–228, DOI: 10.1112/S0025579300013462.
- Mazzuoccolo2013BergeOpen source ↗
The equivalence of two conjectures of Berge and Fulkerson
Giuseppe Mazzuoccolo · 2011 · misc
Giuseppe Mazzuoccolo, “The equivalence of two conjectures of Berge and Fulkerson,” Journal of Graph Theory 68 (2011), 125–128, DOI: 10.1002/jgt.20545.
- Miller2013EvasivenessOpen source ↗
Evasiveness of graph properties and topological fixed-point theorems
James C. Miller · 2013 · misc
James C. Miller, “Evasiveness of graph properties and topological fixed-point theorems,” arXiv:1306.0110 (2013), https://arxiv.org/abs/1306.0110.
- Mkrtchyan2025OrientedOpen source ↗
An oriented Berge–Fulkerson conjecture
Vahan V. Mkrtchyan · 2025 · misc
Vahan V. Mkrtchyan, “An oriented Berge–Fulkerson conjecture,” arXiv:2501.05348 (2025), https://arxiv.org/abs/2501.05348.
- MolloyReed1998TotalOpen source ↗
A bound on the total chromatic number
Michael Molloy and Bruce Reed · 1998 · misc
Michael Molloy and Bruce Reed, “A bound on the total chromatic number,” Combinatorica 18 (1998), 241–280, DOI: 10.1007/PL00009820.
- Montgomery2023TransversalOpen source ↗
Transversals in Latin squares
Richard Montgomery · 2023 · misc
Richard Montgomery, “Transversals in Latin squares,” arXiv:2310.19779 (2023), https://arxiv.org/abs/2310.19779.
- Montgomery2026SurveyOpen source ↗
Transversals in Latin squares: a survey
Richard Montgomery · 2026 · misc
Richard Montgomery, “Transversals in Latin squares: a survey” (2026), https://rhmontgomery.warwick.ac.uk/papers/37transversalssurvey.pdf.
- MulmuleySohoni2001GCTOpen source ↗
Geometric complexity theory I: an approach to the P vs. NP and related problems
Ketan D. Mulmuley and Milind Sohoni · 2001 · misc
Ketan D. Mulmuley and Milind Sohoni, “Geometric complexity theory I: an approach to the P vs. NP and related problems,” SIAM Journal on Computing 31 (2001), 496–526, DOI: 10.1137/S009753970038715X.
- MurrayWilliams2017MCSPOpen source ↗
On the (non) NP-hardness of computing circuit complexity
Cody D. Murray and R. Ryan Williams · 2017 · misc
Cody D. Murray and R. Ryan Williams, “On the (non) NP-hardness of computing circuit complexity,” Theory of Computing 13 (2017), Article 4, DOI: 10.4086/toc.2017.v013a004.
- Musin2008KissingOpen source ↗
The kissing number in four dimensions
Oleg R. Musin · 2008 · misc
Oleg R. Musin, “The kissing number in four dimensions,” Annals of Mathematics 168 (2008), 1–32, DOI: 10.4007/annals.2008.168.1.
- NatarajanNirkhe2024QPCPOpen source ↗
The status of the quantum PCP conjecture
Anand Natarajan and Chinmay Nirkhe · 2024 · misc
Anand Natarajan and Chinmay Nirkhe, “The status of the quantum PCP conjecture,” arXiv:2403.13084 (2024), https://arxiv.org/abs/2403.13084.
- Neuen2026GIOpen source ↗
Parameterized complexity of graph isomorphism testing
Daniel Neuen · 2026 · misc
Daniel Neuen, “Parameterized complexity of graph isomorphism testing,” Computer Science Review 61 (2026), Article 100918, DOI: 10.1016/j.cosrev.2026.100918.
- NguyenScottSeymour2026P5Open source ↗
Induced subgraph density. VII. The five-vertex path
Tung Nguyen and Alex Scott and Paul Seymour · 2026 · misc
Tung Nguyen, Alex Scott, and Paul Seymour, “Induced subgraph density. VII. The five-vertex path,” Proceedings of the London Mathematical Society 132 (2026), Article e70133, DOI: 10.1112/plms.70133, https://arxiv.org/abs/2312.15333.
- Nikoghosyan2012ToughnessOpen source ↗
Non-Hamiltonian graphs with high toughness
Zh. G. Nikoghosyan · 2012 · misc
Zh. G. Nikoghosyan, “Non-Hamiltonian graphs with high toughness,” arXiv:1207.5139 (2012), https://arxiv.org/abs/1207.5139.
- NorineEtAl2026HadwigerOpen source ↗
Breaking the degeneracy barrier for coloring graphs with no K_t minor
Sergey Norin and Luke Postle and Zi-Xia Song · 1910 · misc
Sergey Norin, Luke Postle, and Zi-Xia Song, “Breaking the degeneracy barrier for coloring graphs with no K_t minor,” arXiv:1910.09378 (current version), https://arxiv.org/abs/1910.09378.
- OpenAI2026UnitDistanceOpen source ↗
A model disproves a long-standing conjecture in discrete geometry
OpenAI · 2026 · misc
OpenAI, “A model disproves a long-standing conjecture in discrete geometry,” May 20, 2026, https://openai.com/index/model-disproves-discrete-geometry-conjecture/
- PerarnauSerra2025Open source ↗
The lonely runner conjecture turns 60
Guillem Perarnau and Oriol Serra · 2025 · misc
Guillem Perarnau and Oriol Serra, “The lonely runner conjecture turns 60,” survey, arXiv:2409.20160 (revised 2025), https://arxiv.org/abs/2409.20160.
- Pomerance2008FactoringOpen source ↗
A tale of two sieves
Carl Pomerance · 1996 · misc
Carl Pomerance, “A tale of two sieves,” Notices of the AMS 43 (1996), 1473–1485, https://www.ams.org/notices/199612/pomerance.pdf.
- Radziszowski2024CrossingOpen source ↗
A survey of graphs with known or bounded crossing numbers
Kieran Clancy and Michael Haythorpe and Alex Newcombe · 2020 · misc
Kieran Clancy, Michael Haythorpe, and Alex Newcombe, “A survey of graphs with known or bounded crossing numbers,” Australasian Journal of Combinatorics 78 (2020), 209–296, https://ajc.maths.uq.edu.au/pdf/78/ajc_v78_p209.pdf.
- Radziszowski2026RamseyOpen source ↗
Small Ramsey numbers
Stanisław P. Radziszowski · 2026 · misc
Stanisław P. Radziszowski, “Small Ramsey numbers,” Electronic Journal of Combinatorics, Dynamic Survey DS1, revision April 24, 2026, DOI: 10.37236/21, https://www.cs.rit.edu/~spr/ElJC/sur.pdf.
- Raghavendra2008CSPOpen source ↗
Optimal algorithms and inapproximability results for every CSP?
Prasad Raghavendra · 2008 · misc
Prasad Raghavendra, “Optimal algorithms and inapproximability results for every CSP?” Proceedings of STOC 2008, 245–254, DOI: 10.1145/1374376.1374414.
- Rao2026SunflowersOpen source ↗
The story of sunflowers
Anup Rao · 2026 · misc
Anup Rao, “The story of sunflowers,” Journal of the London Mathematical Society (2026), DOI: 10.1112/jlms.70380.
- Razborov2010K43Open source ↗
On 3-hypergraphs with forbidden 4-vertex configurations
Alexander A. Razborov · 2010 · misc
Alexander A. Razborov, “On 3-hypergraphs with forbidden 4-vertex configurations,” SIAM Journal on Discrete Mathematics 24 (2010), 946–963, DOI: 10.1137/090747476.
- Reed1998OmegaDeltaOpen source ↗
\omega,\Delta, and \chi
Bruce Reed · 1998 · misc
Bruce Reed, “\omega,\Delta, and \chi,” Journal of Graph Theory 27 (1998), 177–212, DOI: 10.1002/(SICI)1097-0118(199804)27:4<177::AID-JGT1>3.0.CO;2-K.
- Reinhardt1934
Über die dichteste gitterförmige Lagerung kongruenter Bereiche in der Ebene und eine besondere Art konvexer Kurven
Karl Reinhardt · 1934 · misc
Karl Reinhardt, “Über die dichteste gitterförmige Lagerung kongruenter Bereiche in der Ebene und eine besondere Art konvexer Kurven,” Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 10 (1934), 216–230.
- RivestVuillemin1975Open source ↗
On recognizing graph properties from adjacency matrices
Ronald L. Rivest and Jean Vuillemin · 1976 · misc
Ronald L. Rivest and Jean Vuillemin, “On recognizing graph properties from adjacency matrices,” Theoretical Computer Science 3 (1976), 371–384, DOI: 10.1016/0304-3975(76)90053-0.
- Rosa1967Graceful
On certain valuations of the vertices of a graph
Alexander Rosa · 1967 · misc
Alexander Rosa, “On certain valuations of the vertices of a graph,” in Theory of Graphs, International Symposium, Rome 1966, Gordon and Breach (1967), 349–355.
- RotaBasisHuangRota1994Open source ↗
On the relations of various conjectures on Latin squares and straightening coefficients
Rosa Q. Huang and Gian-Carlo Rota · 1994 · misc
Rosa Q. Huang and Gian-Carlo Rota, “On the relations of various conjectures on Latin squares and straightening coefficients,” Discrete Mathematics 128 (1994), 225–236, DOI: 10.1016/0012-365X(94)90114-7.
- RotemSchejterSlomka2026IlluminationOpen source ↗
The complex illumination problem
Liran Rotem and Alon Schejter and Boaz A. Slomka · 2026 · misc
Liran Rotem, Alon Schejter, and Boaz A. Slomka, “The complex illumination problem,” Combinatorica 46 (2026), Article 3, DOI: 10.1007/s00493-025-00195-7.
- SanyalWernerZiegler2009Open source ↗
On Kalai's conjectures concerning centrally symmetric polytopes
Raman Sanyal and Axel Werner and Günter M. Ziegler · 2009 · misc
Raman Sanyal, Axel Werner, and Günter M. Ziegler, “On Kalai's conjectures concerning centrally symmetric polytopes,” Discrete \& Computational Geometry 41 (2009), 183–198, DOI: 10.1007/s00454-008-9104-8.
- Sauermann2024RotaOpen source ↗
Rota's basis conjecture holds for random bases of vector spaces
Lisa Sauermann · 2024 · misc
Lisa Sauermann, “Rota's basis conjecture holds for random bases of vector spaces,” European Journal of Combinatorics 121 (2024), Article 103836, DOI: 10.1016/j.ejc.2023.103836, https://arxiv.org/abs/2203.17121.
- Savitch1970Open source ↗
Relationships between nondeterministic and deterministic tape complexities
Walter J. Savitch · 1970 · misc
Walter J. Savitch, “Relationships between nondeterministic and deterministic tape complexities,” Journal of Computer and System Sciences 4 (1970), 177–192, DOI: 10.1016/S0022-0000(70)80006-X.
- SawinEtAl2026UnitDistanceOpen source ↗
Superlinear many unit distances in the plane
Will Sawin and others · 2026 · misc
Will Sawin et al., “Superlinear many unit distances in the plane,” externally reviewed proof (2026), https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-proof.pdf.
- Schwartz1980PITOpen source ↗
Fast probabilistic algorithms for verification of polynomial identities
Jacob T. Schwartz · 1980 · misc
Jacob T. Schwartz, “Fast probabilistic algorithms for verification of polynomial identities,” Journal of the ACM 27 (1980), 701–717, DOI: 10.1145/322217.322225.
- ScottSudakov2011MeynielOpen source ↗
A new bound for the cops and robbers problem
Alex Scott and Benny Sudakov · 2011 · misc
Alex Scott and Benny Sudakov, “A new bound for the cops and robbers problem,” SIAM Journal on Discrete Mathematics 25 (2011), 1438–1442, DOI: 10.1137/100812963.
- Seymour1981SixFlowOpen source ↗
Nowhere-zero 6-flows
Paul D. Seymour · 1981 · misc
Paul D. Seymour, “Nowhere-zero 6-flows,” Journal of Combinatorial Theory, Series B 30 (1981), 130–135, DOI: 10.1016/0095-8956(81)90058-7.
- Seymour2016HadwigerOpen source ↗
Hadwiger's conjecture
Paul Seymour · 2016 · misc
Paul Seymour, “Hadwiger's conjecture,” in Open Problems in Mathematics, Springer (2016), 417–437, DOI: 10.1007/978-3-319-32162-2_13.
- Sheffer2026DistancesOpen source ↗
Polynomial Methods and Incidence Theory
Adam Sheffer · 2022 · misc
Adam Sheffer, Polynomial Methods and Incidence Theory, Cambridge University Press (2022), DOI: 10.1017/9781108698672.
- Shor1997FactoringOpen source ↗
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W. Shor · 1997 · misc
Peter W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing 26 (1997), 1484–1509, DOI: 10.1137/S0097539795293172.
- ShpilkaYehudayoff2010Open source ↗
Arithmetic circuits: a survey of recent results and open questions
Amir Shpilka and Amir Yehudayoff · 2010 · misc
Amir Shpilka and Amir Yehudayoff, “Arithmetic circuits: a survey of recent results and open questions,” Foundations and Trends in Theoretical Computer Science 5 (2010), 207–388, DOI: 10.1561/0400000039.
- Sidorenko1993Open source ↗
A correlation inequality for bipartite graphs
Alexander F. Sidorenko · 1993 · misc
Alexander F. Sidorenko, “A correlation inequality for bipartite graphs,” Graphs and Combinatorics 9 (1993), 201–204, DOI: 10.1007/BF02988307.
- SolomonWeiss2016DanzerOpen source ↗
Dense forests and Danzer sets
Yaar Solomon and Barak Weiss · 2016 · misc
Yaar Solomon and Barak Weiss, “Dense forests and Danzer sets,” Annales Scientifiques de l'École Normale Supérieure 49 (2016), 1053–1074, DOI: 10.24033/asens.2303.
- Solymosi2003RationalDistancesOpen source ↗
On a question of Erdős and Ulam
József Solymosi and Frank de Zeeuw · 2010 · misc
József Solymosi and Frank de Zeeuw, “On a question of Erdős and Ulam,” Discrete \& Computational Geometry 43 (2010), 393–401, DOI: 10.1007/s00454-009-9179-x.
- SpencerSzemerediTrotter1984Unit
Unit distances in the Euclidean plane
Joel Spencer and Endre Szemerédi and William T. Trotter · 1984 · misc
Joel Spencer, Endre Szemerédi, and William T. Trotter, “Unit distances in the Euclidean plane,” in Graph Theory and Combinatorics, Academic Press (1984), 293–303.
- Stein1975TransversalOpen source ↗
Transversals of Latin squares and their generalizations
Sherman K. Stein · 1975 · misc
Sherman K. Stein, “Transversals of Latin squares and their generalizations,” Pacific Journal of Mathematics 59 (1975), 567–575, DOI: 10.2140/pjm.1975.59.567.
- Strassen1969Open source ↗
Gaussian elimination is not optimal
Volker Strassen · 1969 · misc
Volker Strassen, “Gaussian elimination is not optimal,” Numerische Mathematik 13 (1969), 354–356, DOI: 10.1007/BF02165411.
- Suk2017HappyEndingOpen source ↗
On the Erdős–Szekeres convex polygon problem
Andrew Suk · 2017 · misc
Andrew Suk, “On the Erdős–Szekeres convex polygon problem,” Journal of the American Mathematical Society 30 (2017), 1047–1053, DOI: 10.1090/jams/869.
- Sullivan2006SecondNeighborhoodOpen source ↗
A summary of results and problems related to the Caccetta–Häggkvist conjecture
Blair D. Sullivan · 2006 · misc
Blair D. Sullivan, “A summary of results and problems related to the Caccetta–Häggkvist conjecture,” arXiv:math/0605646 (2006), https://arxiv.org/abs/math/0605646.