Finite-family conjecture for (4,2) pillars
Statement
Let an equiangular set have angle and base size , and consider a pillar and its Seidel graph. Finite-family conjecture for pillars. In the case where and base size , there are only a finite number of families of connected graphs 's such that the connected components of the Seidel graph of any pillar in an equiangular set is either a graph or a subgraph of a graph in . This conjecture concerns the remaining -pillar case in the Lemmens–Seidel problem; the supplied text gives no proof or disproof.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.