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
- ErdosSzekeres1935Open source ↗
A combinatorial problem in geometry
Paul Erdős and George Szekeres · 1935 · misc
Paul Erdős and George Szekeres, “A combinatorial problem in geometry,” Compositio Mathematica 2 (1935), 463–470, http://www.numdam.org/item/CM_1935__2__463_0/
- ExooIsmailescu2020PlaneOpen source ↗
The chromatic number of the plane is at least 5: a new proof
Geoffrey Exoo and Dan Ismailescu · 2020 · misc
Geoffrey Exoo and Dan Ismailescu, “The chromatic number of the plane is at least 5: a new proof,” Discrete \& Computational Geometry 64 (2020), 216–226, DOI: 10.1007/s00454-019-00058-1.
- Falconer1985DistanceOpen source ↗
On the Hausdorff dimensions of distance sets
Kenneth J. Falconer · 1985 · misc
Kenneth J. Falconer, “On the Hausdorff dimensions of distance sets,” Mathematika 32 (1985), 206–212, DOI: 10.1112/S0025579300010998.
- Fisher1996SecondNeighborhoodOpen source ↗
Squaring a tournament: a proof of Dean's conjecture
David C. Fisher · 1996 · misc
David C. Fisher, “Squaring a tournament: a proof of Dean's conjecture,” Journal of Graph Theory 23 (1996), 43–48, DOI: 10.1002/(SICI)1097-0118(199609)23:1<43::AID-JGT4>3.0.CO;2-K.
- Florek2025BarnetteOpen source ↗
A sufficient condition for cubic 3-connected plane bipartite graphs to be Hamiltonian
Jan Florek · 2025 · misc
Jan Florek, “A sufficient condition for cubic 3-connected plane bipartite graphs to be Hamiltonian,” Journal of Graph Theory 110 (2025), 272–282, DOI: 10.1002/jgt.23270.
- FoxKeevashSudakov2010DirectedOpen source ↗
Directed graphs without short cycles
Jacob Fox and Peter Keevash and Benny Sudakov · 2010 · misc
Jacob Fox, Peter Keevash, and Benny Sudakov, “Directed graphs without short cycles,” Combinatorics, Probability and Computing 19 (2010), 285–301, DOI: 10.1017/S0963548309990460, https://arxiv.org/abs/0809.4690.
- FradeliziMeyerZvavitch2023Open source ↗
Volume product
Matthieu Fradelizi and Mathieu Meyer and Artem Zvavitch · 2023 · misc
Matthieu Fradelizi, Mathieu Meyer, and Artem Zvavitch, “Volume product,” in The Brunn–Minkowski Inequality, De Gruyter (2023), DOI: 10.1515/9783110775389-005.
- Frankl1987CopsOpen source ↗
Cops and robbers in graphs with large girth and Cayley graphs
Peter Frankl · 1987 · misc
Peter Frankl, “Cops and robbers in graphs with large girth and Cayley graphs,” Discrete Applied Mathematics 17 (1987), 301–305, DOI: 10.1016/0166-218X(87)90033-3.
- FulekPach2019ThrackleOpen source ↗
Thrackles: An improved upper bound
Radoslav Fulek and János Pach · 2019 · misc
Radoslav Fulek and János Pach, “Thrackles: An improved upper bound,” Discrete Applied Mathematics 259 (2019), 226–231, DOI: 10.1016/j.dam.2018.12.025, https://arxiv.org/abs/1708.08037.
- Fulkerson1971BlockingOpen source ↗
Blocking and anti-blocking pairs of polyhedra
D. R. Fulkerson · 1971 · misc
D. R. Fulkerson, “Blocking and anti-blocking pairs of polyhedra,” Mathematical Programming 1 (1971), 168–194, DOI: 10.1007/BF01584085.
- GajentaanOvermars1995Open source ↗
On a class of O(n^2) problems in computational geometry
Anka Gajentaan and Mark H. Overmars · 1995 · misc
Anka Gajentaan and Mark H. Overmars, “On a class of O(n^2) problems in computational geometry,” Computational Geometry 5 (1995), 165–185, DOI: 10.1016/0925-7721(95)00022-2.
- Gallian2025LabelingOpen source ↗
A dynamic survey of graph labeling
Joseph A. Gallian · 2025 · misc
Joseph A. Gallian, “A dynamic survey of graph labeling,” Electronic Journal of Combinatorics, Dynamic Survey DS6, current 2025 revision, DOI: 10.37236/27.
- Galvin1995ListEdgeOpen source ↗
The list chromatic index of a bipartite multigraph
Fred Galvin · 1995 · misc
Fred Galvin, “The list chromatic index of a bipartite multigraph,” Journal of Combinatorial Theory, Series B 63 (1995), 153–158, DOI: 10.1006/jctb.1995.1011.
- Gibbs2018UniversalOpen source ↗
An upper bound for Lebesgue's universal covering problem
Philip Gibbs · 2020 · misc
Philip Gibbs, “An upper bound for Lebesgue's universal covering problem,” Experimental Mathematics 29 (2020), 327–336, DOI: 10.1080/10586458.2018.1466376.
- Gill1977ProbabilisticOpen source ↗
Computational complexity of probabilistic Turing machines
John Gill · 1977 · misc
John Gill, “Computational complexity of probabilistic Turing machines,” SIAM Journal on Computing 6 (1977), 675–695, DOI: 10.1137/0206049.
- Goldreich2001CryptoOpen source ↗
Foundations of Cryptography, Volume 1: Basic Tools
Oded Goldreich · 2001 · misc
Oded Goldreich, Foundations of Cryptography, Volume 1: Basic Tools, Cambridge University Press (2001), DOI: 10.1017/CBO9780511546891.
- GorskySteinerWiederrecht2022BarnetteOpen source ↗
Matching theory and Barnette's conjecture
Maximilian Gorsky and Raphael Steiner and Sebastian Wiederrecht · 2023 · misc
Maximilian Gorsky, Raphael Steiner, and Sebastian Wiederrecht, “Matching theory and Barnette's conjecture,” Discrete Mathematics 346 (2023), Article 113249, DOI: 10.1016/j.disc.2022.113249, https://arxiv.org/abs/2202.11641.
- GreenlawHooverRuzzo1995Open source ↗
Limits to Parallel Computation: P-Completeness Theory
Raymond Greenlaw and H. James Hoover and Walter L. Ruzzo · 1995 · misc
Raymond Greenlaw, H. James Hoover, and Walter L. Ruzzo, Limits to Parallel Computation: P-Completeness Theory, Oxford University Press (1995), https://www.cs.cornell.edu/courses/cs5220/2014fa/PCom.pdf.
- GroheNeuen2021GIOpen source ↗
Recent advances on the graph isomorphism problem
Martin Grohe and Daniel Neuen · 2021 · misc
Martin Grohe and Daniel Neuen, “Recent advances on the graph isomorphism problem,” arXiv:2011.01366 (2021), https://arxiv.org/abs/2011.01366.
- GronlundPettie2014ThreeSUMOpen source ↗
Threesomes, degenerates, and love triangles
Allan Grønlund and Seth Pettie · 2014 · misc
Allan Grønlund and Seth Pettie, “Threesomes, degenerates, and love triangles,” Proceedings of FOCS 2014, 621–630, DOI: 10.1109/FOCS.2014.72.
- GuthKatz2015DistancesOpen source ↗
On the Erdős distinct distances problem in the plane
Larry Guth and Nets Hawk Katz · 2015 · misc
Larry Guth and Nets Hawk Katz, “On the Erdős distinct distances problem in the plane,” Annals of Mathematics 181 (2015), 155–190, DOI: 10.4007/annals.2015.181.1.2.
- Guy1960Crossing
A combinatorial problem
Richard K. Guy · 1960 · misc
Richard K. Guy, “A combinatorial problem,” Nabla (Bulletin of the Malayan Mathematical Society) 7 (1960), 68–72.
- Guy1972CrossingOpen source ↗
Crossing numbers of graphs
Richard K. Guy · 1972 · misc
Richard K. Guy, “Crossing numbers of graphs,” in Graph Theory and Applications, Lecture Notes in Mathematics 303, Springer (1972), 111–124, DOI: 10.1007/BFb0067363.
- Hadamard1893Open source ↗
Résolution d'une question relative aux déterminants
Jacques Hadamard · 1893 · misc
Jacques Hadamard, “Résolution d'une question relative aux déterminants,” Bulletin des Sciences Mathématiques 17 (1893), 240–246, https://gallica.bnf.fr/ark:/12148/bpt6k3074r/f246.item
- Hadwiger1943
Über eine Klassifikation der Streckenkomplexe
Hugo Hadwiger · 1943 · misc
Hugo Hadwiger, “Über eine Klassifikation der Streckenkomplexe,” Vierteljahrsschrift der Naturforschenden Gesellschaft in Zürich 88 (1943), 133–142.
- Hadwiger1950NelsonOpen source ↗
Überdeckung des euklidischen Raumes durch kongruente Mengen
Hugo Hadwiger · 1945 · misc
Hugo Hadwiger, “Überdeckung des euklidischen Raumes durch kongruente Mengen,” Portugaliae Mathematica 4 (1945), 238–242, http://www.numdam.org/item/PM_1945__4__238_0/
- Hadwiger1957Illumination
Ungeloeste Probleme Nr. 20
Hugo Hadwiger · 1957 · misc
Hugo Hadwiger, “Ungeloeste Probleme Nr. 20,” Elemente der Mathematik 12 (1957), 121.
- Hales2011ReinhardtOpen source ↗
On the Reinhardt conjecture
Thomas C. Hales · 2011 · misc
Thomas C. Hales, “On the Reinhardt conjecture,” arXiv:1103.4518 (2011), https://arxiv.org/abs/1103.4518.
- HalesVajjha2024SmoothedOpen source ↗
Packings of smoothed polygons
Thomas C. Hales and Koundinya Vajjha · 2024 · misc
Thomas C. Hales and Koundinya Vajjha, “Packings of smoothed polygons,” arXiv:2405.04331 (2024), https://arxiv.org/abs/2405.04331.
- Haxell1999TuzaOpen source ↗
Packing and covering triangles in graphs
Penny Haxell · 1999 · misc
Penny Haxell, “Packing and covering triangles in graphs,” Discrete Mathematics 195 (1999), 251–254, DOI: 10.1016/S0012-365X(98)00183-6.
- HaxellScott2021RyserOpen source ↗
On Ryser's conjecture
Penny E. Haxell and Alex Scott · 2021 · misc
Penny E. Haxell and Alex Scott, “On Ryser's conjecture,” Electronic Journal of Combinatorics 28 (2021), Paper P4.37, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v28i4p37.
- HedayatSloaneStufken1999Open source ↗
Orthogonal Arrays: Theory and Applications
A. S. Hedayat and N. J. A. Sloane and John Stufken · 1999 · misc
A. S. Hedayat, N. J. A. Sloane, and John Stufken, Orthogonal Arrays: Theory and Applications, Springer (1999), DOI: 10.1007/978-1-4612-1478-6.
- Hirahara2020MCSPOpen source ↗
Non-black-box worst-case to average-case reductions within NP
Shuichi Hirahara · 2018 · misc
Shuichi Hirahara, “Non-black-box worst-case to average-case reductions within NP,” Proceedings of FOCS 2018, 247–258, DOI: 10.1109/FOCS.2018.00032.
- IAS2026UniqueGamesOpen source ↗
The limits of close enough: Unique Games
Institute for Advanced Study · 2026 · misc
Institute for Advanced Study, “The limits of close enough: Unique Games,” 2026, https://www.ias.edu/ideas/limits-close-enough.
- Immerman1988Open source ↗
Nondeterministic space is closed under complementation
Neil Immerman · 1988 · misc
Neil Immerman, “Nondeterministic space is closed under complementation,” SIAM Journal on Computing 17 (1988), 935–938, DOI: 10.1137/0217058.
- ImpagliazzoLuby1989Open source ↗
One-way functions are essential for complexity based cryptography
Russell Impagliazzo and Michael Luby · 1989 · misc
Russell Impagliazzo and Michael Luby, “One-way functions are essential for complexity based cryptography,” Proceedings of FOCS 1989, 230–235, DOI: 10.1109/SFCS.1989.63483.
- ImpagliazzoPaturi2001ETHOpen source ↗
On the complexity of k-SAT
Russell Impagliazzo and Ramamohan Paturi · 2001 · misc
Russell Impagliazzo and Ramamohan Paturi, “On the complexity of k-SAT,” Journal of Computer and System Sciences 62 (2001), 367–375, DOI: 10.1006/jcss.2000.1727.
- ImpagliazzoPaturiZane2001Open source ↗
Which problems have strongly exponential complexity?
Russell Impagliazzo and Ramamohan Paturi and Francis Zane · 2001 · misc
Russell Impagliazzo, Ramamohan Paturi, and Francis Zane, “Which problems have strongly exponential complexity?” Journal of Computer and System Sciences 63 (2001), 512–530, DOI: 10.1006/jcss.2001.1774.
- ImpagliazzoWigderson1997Open source ↗
P=BPP if E requires exponential circuits
Russell Impagliazzo and Avi Wigderson · 1997 · misc
Russell Impagliazzo and Avi Wigderson, “P=BPP if E requires exponential circuits,” Proceedings of STOC 1997, 220–229, DOI: 10.1145/258533.258590.
- Jerrum1992CliqueOpen source ↗
Large cliques elude the Metropolis process
Mark Jerrum · 1992 · misc
Mark Jerrum, “Large cliques elude the Metropolis process,” Random Structures \& Algorithms 3 (1992), 347–359, DOI: 10.1002/rsa.3240030402.
- KabanetsImpagliazzo2004Open source ↗
Derandomizing polynomial identity tests means proving circuit lower bounds
Valentine Kabanets and Russell Impagliazzo · 2004 · misc
Valentine Kabanets and Russell Impagliazzo, “Derandomizing polynomial identity tests means proving circuit lower bounds,” Computational Complexity 13 (2004), 1–46, DOI: 10.1007/s00037-004-0182-6.
- Kahn1996AsymptoticListOpen source ↗
Asymptotics of the list-chromatic index for multigraphs
Jeff Kahn · 2000 · misc
Jeff Kahn, “Asymptotics of the list-chromatic index for multigraphs,” Random Structures \& Algorithms 17 (2000), 117–156, DOI: 10.1002/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9.
- KahnKalai1993BorsukOpen source ↗
A counterexample to Borsuk's conjecture
Jeff Kahn and Gil Kalai · 1993 · misc
Jeff Kahn and Gil Kalai, “A counterexample to Borsuk's conjecture,” Bulletin of the American Mathematical Society 29 (1993), 60–62, DOI: 10.1090/S0273-0979-1993-00398-7.
- KahnSaksSturtevant1984Open source ↗
A topological approach to evasiveness
Jeff Kahn and Michael Saks and Dean Sturtevant · 1984 · misc
Jeff Kahn, Michael Saks, and Dean Sturtevant, “A topological approach to evasiveness,” Combinatorica 4 (1984), 297–306, DOI: 10.1007/BF02579140.
- Kalai1989CSOpen source ↗
The number of faces of centrally-symmetric polytopes
Gil Kalai · 1989 · misc
Gil Kalai, “The number of faces of centrally-symmetric polytopes,” Graphs and Combinatorics 5 (1989), 389–391, DOI: 10.1007/BF01788696.
- KangEtAl2023EFLOpen source ↗
A proof of the Erdős–Faber–Lovász conjecture for large graphs
Dong Yeap Kang and Tom Kelly and Daniela Kühn and Abhishek Methuku and Deryk Osthus · 2023 · misc
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus, “A proof of the Erdős–Faber–Lovász conjecture for large graphs,” Annals of Mathematics 198 (2023), 537–618, DOI: 10.4007/annals.2023.198.2.2.
- Karp1972Open source ↗
Reducibility among combinatorial problems
Richard M. Karp · 2001 · misc
Richard M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, Plenum (1972), 85–103, DOI: 10.1007/978-1-4684-2001-2_9.
- KarpLipton1980Open source ↗
Some connections between nonuniform and uniform complexity classes
Richard M. Karp and Richard J. Lipton · 1980 · misc
Richard M. Karp and Richard J. Lipton, “Some connections between nonuniform and uniform complexity classes,” Proceedings of STOC 1980, 302–309, DOI: 10.1145/800141.804678.