Source ledger
References
918 bibliography records ground the catalog in original papers, established surveys and monographs, institutional problem lists, and formal-proof archives.
Complete bibliography
918 records
- Keevash2011HypergraphTuranOpen source ↗
Hypergraph Turán problems
Peter Keevash · 2011 · misc
Peter Keevash, “Hypergraph Turán problems,” in Surveys in Combinatorics 2011, London Mathematical Society Lecture Note Series 392, Cambridge University Press, 83–140, DOI: 10.1017/CBO9781139004114.004, https://people.maths.ox.ac.uk/keevash/papers/turan-survey.pdf.
- KharaghaniTayfehRezaie2005Open source ↗
A Hadamard matrix of order 428
Hadi Kharaghani and Behruz Tayfeh-Rezaie · 2005 · misc
Hadi Kharaghani and Behruz Tayfeh-Rezaie, “A Hadamard matrix of order 428,” Journal of Combinatorial Designs 13 (2005), 435–440, DOI: 10.1002/jcd.20043.
- Khot2002UGCOpen source ↗
On the power of unique 2-prover 1-round games
Subhash Khot · 2002 · misc
Subhash Khot, “On the power of unique 2-prover 1-round games,” Proceedings of STOC 2002, 767–775, DOI: 10.1145/509907.510017.
- KingReed2014Open source ↗
Bounding \chi in terms of \omega and \Delta
Andrew D. King and Bruce Reed · 2008 · misc
Andrew D. King and Bruce Reed, “Bounding \chi in terms of \omega and \Delta,” Journal of Graph Theory 59 (2008), 215–228, DOI: 10.1002/jgt.20323.
- KirchwegerPeitlSzeider2023EFLOpen source ↗
A SAT Solver's Opinion on the Erdős–Faber–Lovász Conjecture
Markus Kirchweger and Tomáš Peitl and Stefan Szeider · 2023 · misc
Markus Kirchweger, Tomáš Peitl, and Stefan Szeider, “A SAT Solver's Opinion on the Erdős–Faber–Lovász Conjecture,” LIPIcs SAT 2023 271 (2023), 13:1–13:17, DOI: 10.4230/LIPIcs.SAT.2023.13, https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.13.
- KopelowitzPettiePorat2016Open source ↗
Higher lower bounds from the 3SUM conjecture
Tsvi Kopelowitz and Seth Pettie and Ely Porat · 2016 · misc
Tsvi Kopelowitz, Seth Pettie, and Ely Porat, “Higher lower bounds from the 3SUM conjecture,” Proceedings of SODA 2016, 1272–1287, DOI: 10.1137/1.9781611974331.ch89.
- Lam1991Plane10Open source ↗
The search for a finite projective plane of order 10
Clement W. H. Lam · 1991 · misc
Clement W. H. Lam, “The search for a finite projective plane of order 10,” American Mathematical Monthly 98 (1991), 305–318, DOI: 10.1080/00029890.1991.12000759.
- Lebesgue1914Universal
Sur quelques questions de minimum, relatives aux courbes orbiformes, et sur leurs rapports avec le calcul des variations
Henri Lebesgue · 1914 · misc
Henri Lebesgue, “Sur quelques questions de minimum, relatives aux courbes orbiformes, et sur leurs rapports avec le calcul des variations,” Journal de Mathématiques Pures et Appliquées 4 (1914), 67–96.
- Lenstra2000FactoringOpen source ↗
Integer factoring
Arjen K. Lenstra · 2000 · misc
Arjen K. Lenstra, “Integer factoring,” Designs, Codes and Cryptography 19 (2000), 101–128, DOI: 10.1023/A:1008397921377.
- LiuMontgomery2023CyclesOpen source ↗
A proof of Mader's conjecture on large clique subdivisions in C_4-free graphs
Hong Liu and Richard Montgomery · 2023 · misc
Hong Liu and Richard Montgomery, “A proof of Mader's conjecture on large clique subdivisions in C_4-free graphs,” and related cycle consequences, Journal of the American Mathematical Society 36 (2023), https://doi.org/10.1090/jams/1000.
- LokshtanovMarxSaurabh2011Open source ↗
Lower bounds based on the Exponential Time Hypothesis
Daniel Lokshtanov and Dániel Marx and Saket Saurabh · 2011 · misc
Daniel Lokshtanov, Dániel Marx, and Saket Saurabh, “Lower bounds based on the Exponential Time Hypothesis,” Bulletin of the EATCS 105 (2011), 41–72, https://eatcs.org/beatcs/index.php/beatcs/article/view/92.
- LovaszSaks1988LogRankOpen source ↗
Lattices, Möbius functions and communications complexity
László Lovász and Michael Saks · 1988 · misc
László Lovász and Michael Saks, “Lattices, Möbius functions and communications complexity,” Proceedings of FOCS 1988, 81–90, DOI: 10.1109/SFCS.1988.21924.
- Lovett2014SurveyOpen source ↗
Recent advances on the log-rank conjecture in communication complexity
Shachar Lovett · 2014 · misc
Shachar Lovett, “Recent advances on the log-rank conjecture in communication complexity,” arXiv:1403.8106 (2014), https://arxiv.org/abs/1403.8106.
- Lovett2016LogRankOpen source ↗
Communication is bounded by root of rank
Shachar Lovett · 2016 · misc
Shachar Lovett, “Communication is bounded by root of rank,” Journal of the ACM 63 (2016), Article 1, DOI: 10.1145/2724704.
- Mahaney1982SparseOpen source ↗
Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
Stephen R. Mahaney · 1982 · misc
Stephen R. Mahaney, “Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis,” Journal of Computer and System Sciences 25 (1982), 130–143, DOI: 10.1016/0022-0000(82)90002-2.
- Mahler1939
Ein Minimalproblem für konvexe Polygone
Kurt Mahler · 1939 · misc
Kurt Mahler, “Ein Minimalproblem für konvexe Polygone,” Mathematica (Zutphen) B 7 (1939), 118–127.
- 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.