A 2-(22,8,4) design cannot have a 2-(10,4,4) subdesign

Patric Östergård

A 2-(22,8,4) design cannot have a 2-(10,4,4) subdesign

Patric Östergård

Tutkimustuotos: Lehtiartikkeli › Article › Scientific › vertaisarvioitu

Alkuperäiskieli	Englanti
Sivut	257-260
Julkaisu	Designs, Codes and Cryptography
Vuosikerta	27
Numero	3
Tila	Julkaistu - 2002
OKM-julkaisutyyppi	A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Tutkimusalat

BIBD
codes of designs
maximum clique problem

Siteeraa tätä

@article{6825ede99d4c4391b1405dc9c2edefbb,

title = "A 2-(22,8,4) design cannot have a 2-(10,4,4) subdesign",

keywords = "BIBD, codes of designs, maximum clique problem, BIBD, codes of designs, maximum clique problem, BIBD, codes of designs, maximum clique problem",

author = "Patric {\"O}sterg{\aa}rd",

year = "2002",

language = "English",

volume = "27",

pages = "257--260",

journal = "Designs, Codes and Cryptography",

issn = "1573-7586",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - A 2-(22,8,4) design cannot have a 2-(10,4,4) subdesign

AU - Östergård, Patric

PY - 2002

Y1 - 2002

KW - BIBD

KW - codes of designs

KW - maximum clique problem

KW - BIBD

KW - codes of designs

KW - maximum clique problem

KW - BIBD

KW - codes of designs

KW - maximum clique problem

M3 - Article

SN - 1573-7586

VL - 27

SP - 257

EP - 260

JO - Designs, Codes and Cryptography

JF - Designs, Codes and Cryptography

IS - 3

ER -