The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\) (Q252843)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\) |
scientific article; zbMATH DE number 6549741
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\) |
scientific article; zbMATH DE number 6549741 |
Statements
The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\) (English)
0 references
4 March 2016
0 references
Summary: We prove that a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\) does not exist. To prove this, we assume that such a graph exists and derive some combinatorial properties of its local graph. Then we construct a partial linear space from the local graph to display the contradiction.
0 references
distance-regular graph
0 references
nonexistence
0 references
partial linear space
0 references
