54 problems

A primitive distance-regular graph is a distance-regular graph with no nontrivial equivalence relation coming from an imprimitive association scheme. Bannai–Ito conjecture. Any pri…

Delsarte's conjecture. There are no nontrivial perfect codes in Johnson graphs.

Diameter-boundedness conjecture. The diameter of $\Gamma$ is bounded by a function in $b$.

Let $m \geq 2$ be a fixed integer. A geometric distance-regular graph has diameter $D \geq 3$ and intersection number $c_2 \geq 2$. Koolen–Bang's classification conjecture. Any geo…

Bang–Koolen's classification conjecture. Any such graph is a Johnson graph, a Hamming graph, a Grassmann graph, a bilinear forms graph, or has a number of vertices bounded by a fun…

Let $Gamma$ be a $Q$-polynomial distance-regular graph with eigenvalues $theta_i$ and dual eigenvalues $theta_i^*$. For $2\leq i\leq D-1$, define … Assume these expressions are equ…

Let $Gamma$ be a distance-regular graph with classical parameters $(D,b,\alpha,\beta)$, where $b\ne1$, and suppose $Gamma$ is not a dual polar graph. Let $T$ be its Terwilliger alg…

Let $\Gamma$ be a taut distance-regular graph with odd diameter $D\geq 5$. By the source's stated theorem, $\Gamma$ is an antipodal $2$-cover; hence its antipodal quotient is defin…

Let $\Gamma$ be a bipartite distance-regular graph, and let $T$ denote its subconstituent algebra. Assume that, up to isomorphism, there exist exactly two irreducible $T$-modules w…

Let $G$ be a solvable group and let $S$ be a generating set for $G$. The Cayley graph of $G$ with respect to $S$ is a graph on which the $1$-CDDR and CDDR properties are defined. T…

Symmetric generation conjecture. The subspace $\omega^\perp\cap {\rm Sym}(S)$ is the subalgebra of the Norton algebra $EV$ generated by $E\hat x+E\hat y$.

Symmetric-subspace closure conjecture. We have

Let $G$ be a distance-regular graph, let $i(G)$ denote its isoperimetric number, and let $\mu_2$ denote the parameter used in the cited formulation. The isoperimetric-number conjec…

Let $\Gamma$ be a geometric distance-regular graph with diameter $D \geq 3$ and distinct eigenvalues … Let $b = \frac{b_1}{\theta_1 + 1}$. For vertices $x,y$ at distance $i$, let…

Let $\Gamma$ be a geometric distance-regular graph with diameter $D$ and distinct eigenvalues … Let $b = \frac{b_1}{\theta_1 + 1}$. For a Delsarte clique, let $\phi_i$ denote the n…

Let $\Gamma=(X,\mathcal R)$ be the bilinear forms graph, let $x,y\in X$ be adjacent vertices, and let $U=U(x,y)$ be the subspace defined earlier. Let $E=E_1$ be the primitive idemp…

Let $X$ be an antipodal, non-bipartite distance-regular graph of diameter $3$. An endomorphism of $X$ is a graph homomorphism from $X$ to itself, and a subgraph has diameter $2$ wh…

Diameter-bound conjecture. There is a constant $\ell$ such that if $D\geq\ell$, then one of the following statements holds:

Let $H(d,3)$ be the Hamming graph on length-$d$ words over an alphabet of size $3$, and let $\Phi_d(H(d,3))$ be the associated system of polynomials. A solution is all-nonzero if e…

Consider the $Q$-polynomial distance-regular graph $\Gamma=(X,\mathcal R)$ of diameter $D$, its standard module $V$, and the fundamental $\mathbb T$-submodule…

Consider the $Q$-polynomial distance-regular graph $\Gamma=(X,\mathcal R)$, with standard module $V$, diameter $D$, and Krein parameters $q^h_{i,j}$. Let $\Lambda$ be the fundament…

Let $\Gamma=(X,\mathcal R)$ be a $Q$-polynomial distance-regular graph with diameter $D\geq 3$, and let $E$ be a $Q$-polynomial primitive idempotent of $\Gamma$. Assume that the se…

Koolen et al.'s conjecture. If $b\geqslant 2$, then the diameter $D$ is bounded by a function of $b$.

Jurišić–Vidali conjecture. If $\Gamma$ is tight with classical parameters $(D,b,\alpha,\beta)$, $b\geq 2$, then $\Gamma$ is not locally the block graph of an orthogonal array nor t…

Let $q$ and $D$ be integers with $q \ge 2$ and $D \ge 4$. A distance-regular graph with classical parameters … is a graph whose classical parameters are given by this quadruple. No…