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
- Babai2016GIOpen source ↗
Graph isomorphism in quasipolynomial time
László Babai · 2016 · misc
László Babai, “Graph isomorphism in quasipolynomial time,” Proceedings of STOC 2016, 684–697, DOI: 10.1145/2897518.2897542.
- BaiLiPark2026SecondNeighborhoodOpen source ↗
Towards a strengthening of the second neighborhood conjecture
Yandong Bai and Binlong Li and Boram Park · 2026 · misc
Yandong Bai, Binlong Li, and Boram Park, “Towards a strengthening of the second neighborhood conjecture,” arXiv:2607.18047 (2026), https://arxiv.org/abs/2607.18047.
- BaratToth2010AlbertsonOpen source ↗
Towards the Albertson conjecture
János Barát and Géza Tóth · 2010 · misc
János Barát and Géza Tóth, “Towards the Albertson conjecture,” Electronic Journal of Combinatorics 17 (2010), Research Paper R73, DOI: 10.37236/345.
- Barnette1969
Conjecture 5
David Barnette · 1969 · misc
David Barnette, “Conjecture 5,” in W. T. Tutte (ed.), Recent Progress in Combinatorics, Academic Press (1969), p. 343.
- BauerEtAl1990ToughOpen source ↗
Not every 2-tough graph is Hamiltonian
Douglas Bauer and Hajo J. Broersma and Henk Jan Veldman · 2000 · misc
Douglas Bauer, Hajo J. Broersma, and Henk Jan Veldman, “Not every 2-tough graph is Hamiltonian,” Discrete Applied Mathematics 99 (2000), 317–321, DOI: 10.1016/S0166-218X(99)00141-9.
- Behzad1965Total
Graphs and Their Chromatic Numbers
Mehdi Behzad · 1965 · misc
Mehdi Behzad, Graphs and Their Chromatic Numbers, PhD thesis, Michigan State University (1965).
- BennettEtAl2026TuzaOpen source ↗
Almost-perfect packings and Tuza's conjecture in the random geometric graph
Patrick Bennett and Ryan Cushman and Andrzej Dudek and Xavier Pérez-Giménez · 2026 · misc
Patrick Bennett, Ryan Cushman, Andrzej Dudek, and Xavier Pérez-Giménez, “Almost-perfect packings and Tuza's conjecture in the random geometric graph,” arXiv:2606.09736 (2026), https://arxiv.org/abs/2606.09736.
- BermanHartmanis1977Open source ↗
On isomorphisms and density of NP and other complete sets
Leonard Berman and Juris Hartmanis · 1977 · misc
Leonard Berman and Juris Hartmanis, “On isomorphisms and density of NP and other complete sets,” SIAM Journal on Computing 6 (1977), 305–322, DOI: 10.1137/0206023.
- BernsteinVazirani1997Open source ↗
Quantum complexity theory
Ethan Bernstein and Umesh Vazirani · 1997 · misc
Ethan Bernstein and Umesh Vazirani, “Quantum complexity theory,” SIAM Journal on Computing 26 (1997), 1411–1473, DOI: 10.1137/S0097539796300921.
- Bezdek2010IlluminationOpen source ↗
Classical Topics in Discrete Geometry
Károly Bezdek · 2010 · misc
Károly Bezdek, Classical Topics in Discrete Geometry, Springer (2010), Chapter 3, DOI: 10.1007/978-1-4419-0600-7.
- BonamyPerrettPostle2020ReedOpen source ↗
Bounding \chi by a fraction of \Delta for graphs without large cliques
Marthe Bonamy and Tom Kelly and Peter Nelson and Luke Postle · 2022 · misc
Marthe Bonamy, Tom Kelly, Peter Nelson, and Luke Postle, “Bounding \chi by a fraction of \Delta for graphs without large cliques,” Journal of Combinatorial Theory, Series B 157 (2022), 263–282, DOI: 10.1016/j.jctb.2022.06.002.
- BonatoNowakowski2011Open source ↗
The Game of Cops and Robbers on Graphs
Anthony Bonato and Richard J. Nowakowski · 2011 · misc
Anthony Bonato and Richard J. Nowakowski, The Game of Cops and Robbers on Graphs, AMS (2011), DOI: 10.1090/stml/061.
- Bondy1991ReconstructionOpen source ↗
A graph reconstructor's manual
J. A. Bondy · 1991 · misc
J. A. Bondy, “A graph reconstructor's manual,” in Surveys in Combinatorics 1991, London Mathematical Society Lecture Note Series 166, Cambridge University Press, 221–252, DOI: 10.1017/CBO9780511666216.009.
- Borsuk1933Open source ↗
Drei Sätze über die n-dimensionale euklidische Sphäre
Karol Borsuk · 1933 · misc
Karol Borsuk, “Drei Sätze über die n-dimensionale euklidische Sphäre,” Fundamenta Mathematicae 20 (1933), 177–190, http://eudml.org/doc/212650.
- BourgainMilman1987Open source ↗
New volume ratio properties for convex symmetric bodies in \mathbb R^n
Jean Bourgain and Vitali D. Milman · 1987 · misc
Jean Bourgain and Vitali D. Milman, “New volume ratio properties for convex symmetric bodies in \mathbb R^n,” Inventiones Mathematicae 88 (1987), 319–340, DOI: 10.1007/BF01388911.
- BrassMoserPach2005Open source ↗
Research Problems in Discrete Geometry
Peter Brass and William Moser and János Pach · 2005 · misc
Peter Brass, William Moser, and János Pach, Research Problems in Discrete Geometry, Springer (2005), Section 5.11, DOI: 10.1007/0-387-29929-7.
- BrennanBreslerHuleihel2018Open source ↗
Reducibility and computational lower bounds for problems with planted sparse structure
Matthew Brennan and Guy Bresler and Wasim Huleihel · 2018 · misc
Matthew Brennan, Guy Bresler, and Wasim Huleihel, “Reducibility and computational lower bounds for problems with planted sparse structure,” Proceedings of COLT 2018, PMLR 75, 48–166, https://proceedings.mlr.press/v75/brennan18a.html.
- Bringmann2019FineGrainedOpen source ↗
Quadratic conditional lower bounds for string problems and dynamic time warping
Karl Bringmann and Marvin Künnemann · 2015 · misc
Karl Bringmann and Marvin Künnemann, “Quadratic conditional lower bounds for string problems and dynamic time warping,” Proceedings of FOCS 2015, 79–97, DOI: 10.1109/FOCS.2015.15.
- BruhnSchaudt2015Open source ↗
The journey of the union-closed sets conjecture
Henning Bruhn and Oliver Schaudt · 2074 · misc
Henning Bruhn and Oliver Schaudt, “The journey of the union-closed sets conjecture,” Graphs and Combinatorics 31 (2015), 2043–2074, DOI: 10.1007/s00373-014-1515-0.
- Burgisser2000Open source ↗
Completeness and Reduction in Algebraic Complexity Theory
Peter Bürgisser · 2000 · misc
Peter Bürgisser, Completeness and Reduction in Algebraic Complexity Theory, Springer (2000), DOI: 10.1007/978-3-662-04179-6.
- CaccettaHaggkvist1978
On minimal digraphs with given girth
Louis Caccetta and Roland Häggkvist · 1978 · misc
Louis Caccetta and Roland Häggkvist, “On minimal digraphs with given girth,” Congressus Numerantium 21 (1978), 181–187.
- CairnsNikolayevsky2000Open source ↗
Bounds for generalized thrackles
Grant Cairns and Yuri Nikolayevsky · 2000 · misc
Grant Cairns and Yuri Nikolayevsky, “Bounds for generalized thrackles,” Discrete \& Computational Geometry 23 (2000), 191–206, DOI: 10.1007/PL00009495.
- ChristophEtAl2025LinearOpen source ↗
New bounds for linear arboricity and related problems
Micha Christoph and Nemanja Draganić and António Girão and Eoin Hurley and Lukas Michel and Alp Müyesser · 2025 · misc
Micha Christoph, Nemanja Draganić, António Girão, Eoin Hurley, Lukas Michel, and Alp Müyesser, “New bounds for linear arboricity and related problems,” arXiv:2507.20500 (2025), https://arxiv.org/abs/2507.20500.
- Chudnovsky2014EHOpen source ↗
The Erdős–Hajnal conjecture—a survey
Maria Chudnovsky · 2014 · misc
Maria Chudnovsky, “The Erdős–Hajnal conjecture—a survey,” Journal of Graph Theory 75 (2014), 178–190, DOI: 10.1002/jgt.21730.
- Chvatal1973ToughOpen source ↗
Tough graphs and Hamiltonian circuits
Václav Chvátal · 1973 · misc
Václav Chvátal, “Tough graphs and Hamiltonian circuits,” Discrete Mathematics 5 (1973), 215–228, DOI: 10.1016/0012-365X(73)90138-6.
- CohnElkies2003BoundsOpen source ↗
New upper bounds on sphere packings I
Henry Cohn and Noam Elkies · 2003 · misc
Henry Cohn and Noam Elkies, “New upper bounds on sphere packings I,” Annals of Mathematics 157 (2003), 689–714, DOI: 10.4007/annals.2003.157.689.
- CohnRajagopal2026FiveOpen source ↗
Variations on five-dimensional sphere packings
Henry Cohn and Isaac Rajagopal · 2026 · misc
Henry Cohn and Isaac Rajagopal, “Variations on five-dimensional sphere packings,” Discrete \& Computational Geometry (2026), DOI: 10.1007/s00454-026-00841-x.
- ConlonFoxSudakov2010SidorenkoOpen source ↗
An approximate version of Sidorenko's conjecture
David Conlon and Jacob Fox and Benny Sudakov · 2010 · misc
David Conlon, Jacob Fox, and Benny Sudakov, “An approximate version of Sidorenko's conjecture,” Geometric and Functional Analysis 20 (2010), 1354–1366, DOI: 10.1007/s00039-010-0097-0.
- ConwaySloane1999PackingsOpen source ↗
Sphere Packings, Lattices and Groups
John H. Conway and Neil J. A. Sloane · 1999 · misc
John H. Conway and Neil J. A. Sloane, Sphere Packings, Lattices and Groups, 3rd ed., Springer (1999), DOI: 10.1007/978-1-4757-6568-7.
- Cook1971Open source ↗
The complexity of theorem-proving procedures
Stephen A. Cook · 1971 · misc
Stephen A. Cook, “The complexity of theorem-proving procedures,” Proceedings of STOC 1971, 151–158, DOI: 10.1145/800157.805047.
- Cook1985NCOpen source ↗
A taxonomy of problems with fast parallel algorithms
Stephen A. Cook · 1985 · misc
Stephen A. Cook, “A taxonomy of problems with fast parallel algorithms,” Information and Control 64 (1985), 2–22, DOI: 10.1016/S0019-9958(85)80041-3.
- Cook2006PvsNPOpen source ↗
The P versus NP problem
Stephen A. Cook · 2022 · misc
Stephen A. Cook, “The P versus NP problem,” Clay Mathematics Institute (2006), https://www.claymath.org/wp-content/uploads/2022/06/pvsnp.pdf.
- CookReckhow1979Open source ↗
The relative efficiency of propositional proof systems
Stephen A. Cook and Robert A. Reckhow · 1979 · misc
Stephen A. Cook and Robert A. Reckhow, “The relative efficiency of propositional proof systems,” Journal of Symbolic Logic 44 (1979), 36–50, DOI: 10.2307/2273702.
- Cranston2025AlbertsonOpen source ↗
Progress on Albertson's conjecture
Daniel W. Cranston · 2025 · misc
Daniel W. Cranston, “Progress on Albertson's conjecture,” arXiv:2512.08020 (2025), https://arxiv.org/abs/2512.08020.
- CyganEtAl2015ParameterizedOpen source ↗
Parameterized Algorithms
Marek Cygan et al. · 2015 · misc
Marek Cygan et al., Parameterized Algorithms, Springer (2015), Chapter 14, DOI: 10.1007/978-3-319-21275-3.
- Danzer1965
Zur Lösung des Gallaischen Problems über Kreisscheiben in der euklidischen Ebene
Ludwig Danzer · 1986 · misc
Ludwig Danzer, “Zur Lösung des Gallaischen Problems über Kreisscheiben in der euklidischen Ebene,” Studia Scientiarum Mathematicarum Hungarica 21 (1986), 111–134 (problem circulated in the 1960s).
- DeGrey2018PlaneOpen source ↗
The chromatic number of the plane is at least 5
Aubrey D. N. J. de Grey · 2018 · misc
Aubrey D. N. J. de Grey, “The chromatic number of the plane is at least 5,” Geombinatorics 28 (2018), 18–31, arXiv:1804.02385, https://arxiv.org/abs/1804.02385.
- Dembowski1968FiniteGeometriesOpen source ↗
Finite Geometries
Peter Dembowski · 1968 · misc
Peter Dembowski, Finite Geometries, Springer (1968), DOI: 10.1007/978-3-642-62012-6.
- DiffieHellman1976Open source ↗
New directions in cryptography
Whitfield Diffie and Martin E. Hellman · 1976 · misc
Whitfield Diffie and Martin E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory 22 (1976), 644–654, DOI: 10.1109/TIT.1976.1055638.
- Drisko1998Open source ↗
On the number of even and odd Latin squares of order p+1
Arthur A. Drisko · 1997 · misc
Arthur A. Drisko, “On the number of even and odd Latin squares of order p+1,” Advances in Mathematics 128 (1997), 20–35, DOI: 10.1006/aima.1997.1629.
- DuOuRenZhang2023FalconerOpen source ↗
New improvement to Falconer distance set problem in higher dimensions
Xiumin Du and Yumeng Ou and Kevin Ren and Ruixiang Zhang · 2023 · misc
Xiumin Du, Yumeng Ou, Kevin Ren, and Ruixiang Zhang, “New improvement to Falconer distance set problem in higher dimensions,” arXiv:2309.04103 (2023), https://arxiv.org/abs/2309.04103.
- DufresneEtAl2026ReconstructionOpen source ↗
Shuffling the Deck: Invariant Theory and the Graph Reconstruction Conjecture
Emilie Dufresne and Gabriela Jeronimo and Jenny Kenkel and Haydee Lindo and Nelly Villamizar · 2026 · misc
Emilie Dufresne, Gabriela Jeronimo, Jenny Kenkel, Haydee Lindo, and Nelly Villamizar, “Shuffling the Deck: Invariant Theory and the Graph Reconstruction Conjecture,” arXiv:2604.16567 (2026), https://arxiv.org/abs/2604.16567.
- Erdos1946DistancesOpen source ↗
On sets of distances of n points
Paul Erdős · 1946 · misc
Paul Erdős, “On sets of distances of n points,” American Mathematical Monthly 53 (1946), 248–250, DOI: 10.2307/2305092.
- ErdosFaberLovasz1972
Problems and results in graph theory and combinatorial analysis
Paul Erdős · 1975 · misc
Paul Erdős, “Problems and results in graph theory and combinatorial analysis,” in Proceedings of the Fifth British Combinatorial Conference (1975), 169–192.
- ErdosGyafas1995CyclesOpen source ↗
Some of my favourite unsolved problems
Paul Erdős · 1990 · misc
Paul Erdős, “Some of my favourite unsolved problems,” in A Tribute to Paul Erdős, Cambridge University Press (1990), 467–478, DOI: 10.1017/CBO9780511983917.040.
- ErdosHajnal1989Open source ↗
Ramsey-type theorems
Paul Erdős and András Hajnal · 1989 · misc
Paul Erdős and András Hajnal, “Ramsey-type theorems,” Discrete Applied Mathematics 25 (1989), 37–52, DOI: 10.1016/0166-218X(89)90045-0.
- ErdosProblems64Open source ↗
Erdős problem #64
Thomas Bloom · 2026 · misc
Thomas Bloom, “Erdős problem #64,” current problem record, https://www.erdosproblems.com/64.
- ErdosRado1960SunflowerOpen source ↗
Intersection theorems for systems of sets
Paul Erdős and Richard Rado · 1960 · misc
Paul Erdős and Richard Rado, “Intersection theorems for systems of sets,” Journal of the London Mathematical Society 35 (1960), 85–90, DOI: 10.1112/jlms/s1-35.1.85.