在不可重构的比赛中

L.W. Beineke , E.T. Parker
{"title":"在不可重构的比赛中","authors":"L.W. Beineke ,&nbsp;E.T. Parker","doi":"10.1016/S0021-9800(70)80088-6","DOIUrl":null,"url":null,"abstract":"<div><p>Pairs of non-isomorphic strong tournaments of orders 5 and 6 are given for which the subtournaments of orders 4 and 5, respectively, are pairwise isomorphic. Herefore, only pairs of orders 3 and 4 were known.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"9 4","pages":"Pages 324-326"},"PeriodicalIF":0.0000,"publicationDate":"1970-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80088-6","citationCount":"15","resultStr":"{\"title\":\"On nonreconstructable tournaments\",\"authors\":\"L.W. Beineke ,&nbsp;E.T. Parker\",\"doi\":\"10.1016/S0021-9800(70)80088-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Pairs of non-isomorphic strong tournaments of orders 5 and 6 are given for which the subtournaments of orders 4 and 5, respectively, are pairwise isomorphic. Herefore, only pairs of orders 3 and 4 were known.</p></div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"9 4\",\"pages\":\"Pages 324-326\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1970-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80088-6\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980070800886\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800886","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

给出了5阶和6阶的非同构强竞赛对,其中4阶和5阶的子竞赛分别是对同构的。因此,只有3阶和4阶对是已知的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On nonreconstructable tournaments

Pairs of non-isomorphic strong tournaments of orders 5 and 6 are given for which the subtournaments of orders 4 and 5, respectively, are pairwise isomorphic. Herefore, only pairs of orders 3 and 4 were known.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Announcement A rank inequality for finite geometric lattices On the factorisation of the complete graph into factors of diameter 2 On nonreconstructable tournaments The number of classes of isomorphic graded partially ordered sets
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1