References

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.

Ueber einige Aufgaben der Analysis situs

Otto Toeplitz · 1911 · misc

Verhandlungen der Schweizerischen Naturforschenden Gesellschaft in Solothurn 94 (1911), 197.

A Survey on the Square Peg Problem

Benjamin Matschke · 2014 · misc

Notices of the American Mathematical Society 61 (2014), no. 4, 346–352.

On the Square Peg Problem

Gregory R. Chambers · 2025 · misc

Discrete and Computational Geometry 73 (2025), 1144–1153.

Einige Bemerkungen über das Minkowskische Flächenmaß

Martin Kneser · 1955 · misc

Archiv der Mathematik 6 (1955), 382–390.

On the Volume of the Union of Balls

Balázs Csikós · 1998 · misc

Discrete and Computational Geometry 20 (1998), 449–461.

Pushing disks apart–-the Kneser–Poulsen conjecture in the plane

Károly Bezdek and Robert Connelly · 2002 · misc

Journal für die reine und angewandte Mathematik 553 (2002), 221–236.

Selected topics from the theory of intersections of balls

Károly Bezdek and Zsolt Lángi and Márton Naszódi · 2026 · misc

Discrete Applied Mathematics 382 (2026), 60–82.

Ovals in a Finite Projective Plane

Beniamino Segre · 1955 · misc

Canadian Journal of Mathematics 7 (1955), 414–416.

On sets of vectors of a finite vector space in which every subset of basis size is a basis

Simeon Ball · 2012 · misc

Journal of the European Mathematical Society 14 (2012), 733–748.

On sets of vectors of a finite vector space in which every subset of basis size is a basis II

Simeon Ball and Jan De Beule · 2012 · misc

Designs, Codes and Cryptography 65 (2012), 5–14.

The Maximal Length of $q$-ary MDS Elliptic Codes Is Close to $q-2$

Dongchun Han and Yuan Ren · 2024 · misc

International Mathematics Research Notices 2024, no. 11, 9036–9043.

The Complexity of Stochastic Games

Anne Condon · 1992 · misc

Information and Computation 96 (1992), 203–224.

A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem

Walter Ludwig · 1995 · misc

Information and Computation 117 (1995), 151–155.

Sinks and Ladders: ARRIVAL and SSG with Two Vertices per Level

Bernd Gärtner and Sebastian Haslebacher and Hung P. Hoang · 2026 · misc

13th International Conference on Fun with Algorithms, LIPIcs 366 (2026), article 19, 19:1–19:16.

Relations between average case complexity and approximation complexity

Uriel Feige · 2002 · misc

Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 534–543.

Easily refutable subformulas of large random 3CNF formulas

Uriel Feige and Eran Ofek · 2007 · misc

Theory of Computing 3 (2007), 25–43.