We show that there is no ▫$(75, 32, 10, 16)$▫ strongly regular graph. The result is obtained by a mix of algebraic and computational approaches. The main idea is to build large enough induced ...structure and apply the star complement technique. Our result implies that there is no partial geometry ▫$\operatorname{pg}(4, 7, 2)$▫ and no regular two-graph with ▫$76$▫ vertices, from which it follows that there also exists no strongly regular graph with parameters ▫$(76, 35, 18, 14)$▫. In order to solve this classification problem we also develop an efficient algorithm for the problem of finding a maximal clique in a graph.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
PDF
