The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)

DOI10.1016/0095-8956(84)90070-4zbMath0557.05049OpenAlexW2026915525MaRDI QIDQ762177

Could not fetch data.

Publication date: 1984

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90070-4

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Could not fetch data.