140 problems
Determine whether D-optimal designs exist at orders and . The corresponding supplementary-difference-set existence assertions are: there are subsets…
For every integer , the book Ramsey number satisfies , where is the graph consisting of triangles sharing a common edge…
Let be the cyclic code proposed by Wang, Tang, and Ding, and let denote the design whose blocks are the supports of the minim…
Let be a fixed nonempty finite set of positive integers, let , and let . Determine exactly when…
For every positive integer divisible by , there exists an matrix with entries in such that ; equivalently, the rows of ar…
For all admissible integers , the second-order Zarankiewicz number equals its recursive-line value: .
Let be the number of Steiner triple systems of order containing no Pasch configuration, and let be the number of Latin squares of order containing no…
Determine, up to isomorphism, all simple - designs with that admit a group of automorphisms acting transitively on their blocks; equivalently, classif…
Determine whether a square integer relative Heffter array exists for every integer satisfying . The 2026 source claims an affirmativ…
For every integer , let and consider the incidence family of the complete graph , with one column for each vertex and one row for each edge. If…
This entry tracks Existence conjecture for generalized Steiner systems. The theorem would upgrade asymptotic attainment of the Johnson bound to exact general existence. Latest deve…
This entry tracks Bannai’s Problem; Xiang’s conjecture; Cui–Xia–Xiang rational spherical 4-design problem. It gives broad constructions addressing multiple rational-design existenc…
This entry tracks Wu–Zhou problem on two-weight codes with dual minimum distance three. It settles the cited problem and strengthens the result to a full structural characterizatio…
This entry tracks Extremal maximal mutually orthogonal partial Latin-square conjecture. It resolves the first two nontrivial multiplicities and identifies constructions relevant to…
Given a finite abelian group of order and integers and , determine whether there exists a function such that and, fo…
For positive integers , the complete tripartite graph admits a decomposition into -cycles if and only if ,…
Fix an integer . For a -element set , let be its set of positive differences. Call a Golomb ruler…
A Hadamard matrix is a square array with entries in such that every two distinct rows agree in exactly half of their columns. Hadamard's conjecture. A Hadamard matrix o…
Nash-Williams' conjecture. If is -divisible and
Let be a design and let denote the design obtained from it by the rectangular combination construction,…
Let be the input design, let and be the parameters of Construction , and let…
Gronau–Mullin–Rosa conjecture. For every -vertex tree other than the path on vertices, has an orthogonal double cover by copies of .
Erdős meets Nash-Williams' conjecture. For every integer , every sufficiently large -divisible graph on vertices satisfying
Agrawal's conjecture. If there is a symmetric - design with , then there is an -triple array.
Let denote the -point probability simplex, and let a simplex -design be a collection of points in whose moments agree with those of the uniform simplex…