125 problems
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…
Let be a design and let denote the design obtained from it by the rectangular combination construction,…
Let be the complete -uniform hypergraph on vertex set , and let consist of the missing triplets whenever . A decomposit…
Classification conjecture. Then , and is isometric to the corresponding example found in the examples section.
Polynomial-size uniform subset conjecture. There exists an -uniform subset such that
Let be a symmetric design with Singer parameters … where and is prime. Write for the dimension over of the cod…
Let be an -CM simplicial complex of maximal girth. Let denote the parameter used for its dimension in the paper, and suppose that is not the -skeleton o…
Exact transitive-triple packing conjecture.
Let be the input design, let and be the parameters of Construction , and let…
Erdős meets Nash-Williams' conjecture. For every integer , every sufficiently large -divisible graph on vertices satisfying
Nash-Williams' conjecture. If is -divisible and
Let satisfy the necessary parameter equation referred to in the source as Equation, and suppose that there exists a symmetric BIBD on points with bloc…
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…
Let be a PULB-optimal code, and let be its set of universal minima. Assume that is in general position, meaning that is not contained in a hyperplane. Universal pol…
Agrawal's ordering conjecture. For any -unordered triple array with , there is an -triple array with .
Agrawal's conjecture. If there is a symmetric - design with , then there is an -triple array.
Embedding conjecture. If is a regular Hadamard matrix of order , then such a containing cube and subcube exist.
Glock–Kühn–Osthus conjecture. For each integer , there exists a constant such that, for all integers and all sufficiently large , every -divisible …
Let , let be the power set of , and let a family be an -town modulo when all its sets have cardinality congruent to modul…
Cavenagh–Hämäläinen–Lefevre–Stones' conjecture. For each , there exists an integer such that, for every , every simple par…
Gronau–Mullin–Rosa conjecture. For every -vertex tree other than the path on vertices, has an orthogonal double cover by copies of .
Let be a quaternionic reflection group, or more generally a finite irreducible group of matrices over the quaternions . A subgroup is reducible if it pr…
Partite folklore conjecture. For each integer , the following holds for sufficiently large : if is a balanced partite--divisible -partite graph on vert…
Partite Nash-Williams conjecture. For sufficiently large , if is a balanced partite--divisible -partite graph on vertices with