50 problems
- 0 votes0 replies0 views
The Schmidt–White conjecture on cyclotomic strongly regular graphs
Let be a prime power, let be a positive integer, and let divide . Let be the subgroup of of index , and…
- 0 votes0 replies1 view
Ivanov's conjecture that strongly regular relations imply an amorphic association scheme
Let be an association scheme in which every relation is strongly regular. Ivanov's conjecture. The association scheme must be amorphic. This would exten…
- 0 votes0 replies0 views
Cameron–Kazanidis conjecture on core-completeness of strongly regular graphs
A graph is core-complete if is isomorphic to its core or its core is a complete graph. Strongly regular graphs are graphs with constant parameters governing t…
- 0 votes0 replies0 views
Strong regularity conjecture for the graph of integral distances
Strong regularity conjecture. For even dimension , the graph of integral distances is a strongly regular graph. The conjecture predicts that the common-neig…
- 0 votes0 replies2 views
Triply-transitivity conjecture for collinearity graphs of elliptic polar spaces
Let be a prime power, and let the collinearity graph of the polar space be the graph whose vertices are the points of , with two ve…
- 0 votes0 replies0 views
Cameron's conjecture on strongly-regular graphs with Latin square parameters
Let a strongly-regular graph have Latin square or negative Latin square parameters, and suppose that its subconstituents are strongly regular. Cameron's conjecture. These are the o…
- 0 votes0 replies0 views
Bonini et al.'s curvature conjecture for strongly regular conference graphs
Let be a strongly regular conference graph with parameters , where , and let denote the Lin--Lu--Yau curv…
- 0 votes0 replies1 view
Emms–Hancock–Severini–Wilson conjecture on positive supports of Grover walks
Emms–Hancock–Severini–Wilson conjecture.
- 0 votes0 replies0 views
The characterization of maximum complete and empty subgraphs in the quadrance graph
Maximum subgraph conjecture. If spans a complete subgraph or an empty subgraph of order in , then is a line in .
- 0 votes0 replies1 view
Nonisomorphism conjecture for the Cayley graphs arising from
Let be the partial difference sets constructed in the paper, and let the associated strongly regular Cayley graphs be the Cayley graphs arising from .…
- 0 votes0 replies0 views
Classification conjecture for triply-transitive strongly-regular graphs
Let be a graph as in Hypothesis; in particular, is a strongly-regular graph in the setting of the paper. Complete classification conjecture. The graph is…
- 0 votes0 replies0 views
Tan et al.'s conjecture on co-edge-regular graphs with four eigenvalues
Let be a connected -regular graph with vertices and co-edge-regular with parameter , having four distinct eigenvalues. Let be an integer. Tan et al.'s con…
- 0 votes0 replies0 views
Conjecture on the second-largest cliques in Paley graphs of square order
Let be an odd prime power, and let denote the Paley graph of order . A clique is a set of pairwise adjacent vertices, and two cliques are in the same orbit when t…
- 0 votes0 replies0 views
The non-rank 3 graph vertex-condition conjecture
A graph satisfies the -vertex condition if, for every positive integer , the number of -vertex subgraphs of each isomorphism type containing a given pair…
- 0 votes0 replies0 views
Cohn–de Laat–Leijenhorst conjecture on maximal spherical codes from triangle-free strongly regular graphs
Cohn–de Laat–Leijenhorst conjecture. Three-point semidefinite programming bounds prove that is a maximal spherical code.
- 0 votes0 replies0 views
The characterization conjecture for uniquely -saturated graphs
Uniquely -saturation conjecture. A graph is nontrivial uniquely -saturated if and only if is a strongly regular graph with parameters or…
- 0 votes0 replies0 views
Thas's uniqueness conjecture for hemisystems of the Hermitian surface
Thas's conjecture. J. A. Thas conjectured that the Segre construction for was the only example of a hemisystem on the Hermitian surface .
- 0 votes0 replies0 views
The exact hexagon-count conjecture for strongly regular graphs with parameters and
Let be a strongly regular graph with parameters and , order , and valency . Let denote the number of hexagons in . Exact hexagon-count conject…
- 0 votes0 replies0 views
Ivanov's conjecture on strongly regular relations in association schemes
Let an association scheme be one whose relations are all strongly regular graphs. Ivanov's conjecture. Every association scheme in which all relations are strongly regular is amorp…
- 0 votes0 replies0 views
Strongly regular graphs with linear gaps in Theorem Q12
Strongly regular graph gap problem. Find all strongly regular graphs for which the gap between the lower and upper bounds in Theorem Q12 is .
- 0 votes0 replies0 views
Greaves–Soicher conjecture on the clique adjacency and Hoffman ratio bounds
Let be an edge-regular graph. The Greaves–Soicher conjecture. The clique adjacency bound for is at least as good as the Hoffman ratio bound of the complement graph…
- 0 votes0 replies0 views
Koolen–Gebremichel conjecture on primitive strongly regular graphs with smallest eigenvalue −3
Koolen–Gebremichel conjecture. Either or .
- 0 votes0 replies1 view
Ivanov's 4- and 5-vertex condition conjecture for the families , , and
Ivanov's conjecture. The graphs satisfy the 5-vertex condition, and the graphs and satisfy the 4-vertex condition.
- 0 votes0 replies0 views
Cameron–Goethals–Seidel conjecture on non-grid strongly regular graphs
Cameron–Goethals–Seidel conjecture. Every non-grid example with Latin square or negative Latin square parameters has parameters as in the lemma, or has a complement with these para…
- 0 votes0 replies0 views
Faudree–Rousseau–Sheehan's strongly regular graph conjecture
Faudree–Rousseau–Sheehan's conjecture. There exists a constant such that for every strongly regular graph ,