G-designs having a prescribed number of blocks in common

Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/115569

DC Field	Value	Language
dc.contributor	應用數學系	zh_TW
dc.creator	Fu, Chin-Mei;Huang, Wen-Chung;Tian, Jun-Yuan	en_US
dc.date	2016-10
dc.date.accessioned	2018-01-15T07:02:22Z	-
dc.date.available	2018-01-15T07:02:22Z	-
dc.date.issued	2018-01-15T07:02:22Z	-
dc.identifier.uri	http://nccur.lib.nccu.edu.tw/handle/140.119/115569	-
dc.description.abstract	Two G-designsand (X,X2) are said to intersect in m blocks if [Ai n A2] = m. In this paper, we complete the solution of intersection problem for G-designs, where G is a connected graph of size five which contains a cycle.	en_US
dc.format.extent	177 bytes	-
dc.format.mimetype	text/html	-
dc.relation	Ars Combinatoria, 129, 185-198	en_US
dc.title	G-designs having a prescribed number of blocks in common	en_US
dc.type	article
item.fulltext	With Fulltext	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	article	-
item.grantfulltext	restricted	-
item.cerifentitytype	Publications	-
Appears in Collections:	期刊論文

File	Description	Size	Format
index.html		177 B	HTML2	View/Open

Check