References

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.

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.

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.

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.

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.

Polynomial Methods and Incidence Theory

Adam Sheffer · 2022 · misc

Adam Sheffer, Polynomial Methods and Incidence Theory, Cambridge University Press (2022), DOI: 10.1017/9781108698672.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Reducing the upper bound for the Borsuk number in \mathbb R^4 to 8

Alexander Tolmachev and Vsevolod Voronov · 2026 · misc

Alexander Tolmachev and Vsevolod Voronov, “Reducing the upper bound for the Borsuk number in \mathbb R^4 to 8,” arXiv:2605.19068 (2026), https://arxiv.org/abs/2605.19068.

On an extremal problem in graph theory

Paul Turán · 1941 · misc

Paul Turán, “On an extremal problem in graph theory,” Matematikai és Fizikai Lapok 48 (1941), 436–452.

A contribution to the theory of chromatic polynomials

W. T. Tutte · 1954 · misc

W. T. Tutte, “A contribution to the theory of chromatic polynomials,” Canadian Journal of Mathematics 6 (1954), 80–91, DOI: 10.4153/CJM-1954-010-9.

Conjecture

Zsolt Tuza · 1981 · misc

Zsolt Tuza, “Conjecture,” in Finite and Infinite Sets, Colloquia Mathematica Societatis János Bolyai 37 (1981), 888.

A Collection of Mathematical Problems

Stanisław M. Ulam · 1960 · misc

Stanisław M. Ulam, A Collection of Mathematical Problems, Interscience (1960), Problem III.5.

On some fine-grained questions in algorithms and complexity

Virginia Vassilevska Williams · 2018 · misc

Virginia Vassilevska Williams, “On some fine-grained questions in algorithms and complexity,” Proceedings of ICM 2018, 3431–3472, DOI: 10.1142/9789813272880_0188.

Subcubic equivalences between path, matrix, and triangle problems

Virginia Vassilevska Williams and Ryan Williams · 2010 · misc

Virginia Vassilevska Williams and Ryan Williams, “Subcubic equivalences between path, matrix, and triangle problems,” Proceedings of FOCS 2010, 645–654, DOI: 10.1109/FOCS.2010.67.

Completeness classes in algebra

Leslie G. Valiant · 1979 · misc

Leslie G. Valiant, “Completeness classes in algebra,” Proceedings of STOC 1979, 249–261, DOI: 10.1145/800135.804419.

Some unsolved problems in graph theory

V. G. Vizing · 1968 · misc

V. G. Vizing, “Some unsolved problems in graph theory,” Russian Mathematical Surveys 23:6 (1968), 125–141, DOI: 10.1070/RM1968v023n06ABEH001252.

Coloring the vertices of a graph in prescribed colors

V. G. Vizing · 1976 · misc

V. G. Vizing, “Coloring the vertices of a graph in prescribed colors,” Diskret. Analiz 29 (1976), 3–10 (in Russian).

Quantum computational complexity

John Watrous · 2009 · misc

John Watrous, “Quantum computational complexity,” in Encyclopedia of Complexity and Systems Science, Springer (2009), arXiv:0804.3401, https://arxiv.org/abs/0804.3401.

Tutte's 5-flow conjecture

Douglas B. West · 2026 · misc

Douglas B. West, “Tutte's 5-flow conjecture,” Open Problems, https://dwest.web.illinois.edu/openp/tut5flow.html.

A new algorithm for optimal 2-constraint satisfaction and its implications

Ryan Williams · 2005 · misc

Ryan Williams, “A new algorithm for optimal 2-constraint satisfaction and its implications,” Theoretical Computer Science 348 (2005), 357–365, DOI: 10.1016/j.tcs.2005.09.023.

Nonuniform ACC circuit lower bounds

Ryan Williams · 2014 · misc

Ryan Williams, “Nonuniform ACC circuit lower bounds,” Journal of the ACM 61 (2014), Article 2, DOI: 10.1145/2559903.

Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen

Jörg M. Wills · 1967 · misc

Jörg M. Wills, “Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen,” Monatshefte für Mathematik 71 (1967), 263–269, DOI: 10.1007/BF01298332.

Thrackles and deadlock

D. R. Woodall · 1971 · misc

D. R. Woodall, “Thrackles and deadlock,” Combinatorial Mathematics and its Applications (1971), 335–347.

Upper bounds for packings of spheres of several radii

David de Laat and Fernando Mário de Oliveira Filho and Frank Vallentin · 2014 · misc

David de Laat, Fernando Mário de Oliveira Filho, and Frank Vallentin, “Upper bounds for packings of spheres of several radii,” Forum of Mathematics, Sigma 2 (2014), e23, DOI: 10.1017/fms.2014.24.

A Finite Partially Ordered Set and Its Corresponding Set of Permutations

S. S. Kislitsyn · 1968 · article

Balancing Pairs and the Cross Product Conjecture

G. R. Brightwell and S. Felsner and W. T. Trotter · 1995 · article

Balanced Pairs in Partial Orders

Graham Brightwell · 1999 · article

Some extremal problems on $r$-graphs

William G. Brown and Paul Erdős and Vera T. Sós · 1973 · misc

In Frank Harary and Edgar M. Palmer, eds., New Directions in the Theory of Graphs, Proceedings of the Third Ann Arbor Conference on Graph Theory, Academic Press, New York, 53–63.

Triple systems with no six points carrying three triangles

Imre Z. Ruzsa and Endre Szemerédi · 1978 · misc

In Combinatorics, Proceedings of the Fifth Hungarian Colloquium, Keszthely, 1976, volume II, Colloquia Mathematica Societatis János Bolyai 18, North-Holland, 939–945.

The Brown–Erdős–Sós conjecture in dense triple systems

Giovanne Santos and Mykhaylo Tyomkyn · 2025 · misc

arXiv:2508.09841.

Hamilton graphs and Hamilton circuits

Anton Kotzig · 1964 · misc

In Theory of Graphs and its Applications, Proceedings of the Symposium in Smolenice, 1963, Publishing House of the Czechoslovak Academy of Sciences, Prague, 63–82.

Perfect one-factorizations of the complete graph–-a survey

E. Seah · 1991 · misc

Bulletin of the Institute of Combinatorics and its Applications 1 (1991), 59–70.

The perfect 1-factorisation conjecture holds asymptotically

Yangyang Cheng and Amedeo Sgueglia · 2026 · misc

arXiv:2607.09459.

On Ramsey covering-numbers

András Gyárfás · 1975 · misc

In Infinite and Finite Sets, Keszthely, 1973, volume II, Colloquia Mathematica Societatis János Bolyai 10, North-Holland, 801–816.

Subtrees of a graph and chromatic number

David P. Sumner · 1981 · misc

In Gary Chartrand, ed., The Theory and Applications of Graphs, Wiley, New York, 557–576.

A Note on the Gyárfás–Sumner Conjecture

Tung Nguyen and Alex Scott and Paul Seymour · 2024 · misc

Graphs and Combinatorics 40 (2024), article 33.

Problem 11

László Lovász · 1970 · misc

In Richard K. Guy, Haim Hanani, Norbert Sauer, and Johanan Schönheim, eds., Combinatorial Structures and Their Applications, Proceedings of the Calgary International Conference, 1969, Gordon and Breach, New York, p. 497.

Long cycles in vertex-transitive graphs

László Babai · 1979 · misc

Journal of Graph Theory 3 (1979), 301–304.

Towards the Lovász conjecture via sublinear expanders

Matija Bucić and Micha Christoph and Alexey Pokrovskiy and Raphael Steiner · 2026 · misc

arXiv:2606.09742.