Journal of Combinatorial Theory最新文献

筛选
英文 中文
Some covering concepts in graphs 一些涵盖了图形中的概念
Journal of Combinatorial Theory Pub Date : 1970-01-01 DOI: 10.1016/S0021-9800(70)80011-4
Michael D. Plummer
{"title":"Some covering concepts in graphs","authors":"Michael D. Plummer","doi":"10.1016/S0021-9800(70)80011-4","DOIUrl":"10.1016/S0021-9800(70)80011-4","url":null,"abstract":"<div><p>A family of concepts involving maximum independent sets which have been under recent study are introduced. Interrelations among the concepts are pointed out and some recent relevant work is discussed.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"8 1","pages":"Pages 91-98"},"PeriodicalIF":0.0,"publicationDate":"1970-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80011-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85974413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 222
Designs derived from permutation groups 来自置换群的设计
Journal of Combinatorial Theory Pub Date : 1970-01-01 DOI: 10.1016/S0021-9800(70)80004-7
Marshall Hall Jr., Richard Lane, David Wales
{"title":"Designs derived from permutation groups","authors":"Marshall Hall Jr.,&nbsp;Richard Lane,&nbsp;David Wales","doi":"10.1016/S0021-9800(70)80004-7","DOIUrl":"10.1016/S0021-9800(70)80004-7","url":null,"abstract":"<div><p>Let <em>G</em> be a transitive permutation group on a set Ω of <em>v</em> points {1, 2, …, <em>v</em>}. Let <em>H</em> be an intransitive subgroup of <em>G</em> and let Δ a set of <em>k</em> points where <em>Δ</em> consists of complete orbits of <em>H</em>. Then the images <em>Δ</em><sup>x</sup> of <em>Δ</em> under permutations <em>x</em> of <em>Δ</em> have been shown by the first author to be a partially balanced block design <em>D</em> with <em>G</em> as a group of automorphisms. Under certain circumstances <em>D</em> is a balanced incomplete block design. Here a representation of the simple group PSL<sub>3</sub>(4) of order 20,160 on 56 letters leads to a new symmetric block design with parameters <em>v</em>=56, <em>k</em>-11, <em>λ</em>=2. A representation of the simple group of order 25,920 as U<sub>4</sub>(4) on 45 isotropic points gives a symmetric design with <em>v</em>=45, <em>k</em>=12, <em>λ</em>=3. One representation of U<sub>4</sub>(4) on 40 points, gives the design of planes in PG(3, 3) and exhibits the isomorphism of this group to the symplectic group S<sub>4</sub>(3).</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"8 1","pages":"Pages 12-22"},"PeriodicalIF":0.0,"publicationDate":"1970-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80004-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75491352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 33
Remarks on the van der Waerden permanent conjecture 关于van der Waerden永久猜想的注解
Journal of Combinatorial Theory Pub Date : 1970-01-01 DOI: 10.1016/S0021-9800(70)80008-4
Andrew M. Gleason
{"title":"Remarks on the van der Waerden permanent conjecture","authors":"Andrew M. Gleason","doi":"10.1016/S0021-9800(70)80008-4","DOIUrl":"10.1016/S0021-9800(70)80008-4","url":null,"abstract":"<div><p>The van der Waerden permanent conjecture is shown to belong to a large family of conjectured inequalities which are of some interest in themselves and all of which <em>might</em> be provable by a routine computation with convex bodies. In fact, the permanent conjecture in cases <em>n</em>=3 and 4 does yield to this method. For <em>n</em>=5, with the computations made by hand, no proof was found, but a slight extension of the computation (which would probably require electronic assistance) could still settle this case and perhaps even a few more small values of <em>n</em>. The question of whether the method must work remains open.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"8 1","pages":"Pages 54-64"},"PeriodicalIF":0.0,"publicationDate":"1970-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80008-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78678916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Probability of a pure equilibrium point in n-person games n人博弈中一个纯平衡点的概率
Journal of Combinatorial Theory Pub Date : 1970-01-01 DOI: 10.1016/S0021-9800(70)80015-1
Melvin Dresher
{"title":"Probability of a pure equilibrium point in n-person games","authors":"Melvin Dresher","doi":"10.1016/S0021-9800(70)80015-1","DOIUrl":"10.1016/S0021-9800(70)80015-1","url":null,"abstract":"<div><p>A “random” <em>n</em>-person non-cooperative game—the game that prohibits communication and therefore coalitions among the <em>n</em> players—is shown to have with high probability a pure strategy solution. Such a solution is by definition an equilibrium point or a set of strategies, one for each player, such that if <em>n</em>−1 players use their equilibrium strategies then the <em>n</em>-th player has no reason to deviate from his equilibrium strategy. It is shown that the probability of a solution in pure strategies for large random <em>n</em>-person games converges to (1−1/<em>e</em>) for all <em>n</em>≥2.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"8 1","pages":"Pages 134-145"},"PeriodicalIF":0.0,"publicationDate":"1970-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80015-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89073303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 59
A lower bound for the number of non-isomorphic matroids 非同构拟阵数目的下界
Journal of Combinatorial Theory Pub Date : 1969-12-01 DOI: 10.1016/S0021-9800(69)80064-5
Béla Bollobás
{"title":"A lower bound for the number of non-isomorphic matroids","authors":"Béla Bollobás","doi":"10.1016/S0021-9800(69)80064-5","DOIUrl":"https://doi.org/10.1016/S0021-9800(69)80064-5","url":null,"abstract":"","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 4","pages":"Pages 366-368"},"PeriodicalIF":0.0,"publicationDate":"1969-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80064-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91610975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Solution of the heawood map-coloring problem—Case 2 heawood地图上色问题的解法——案例2
Journal of Combinatorial Theory Pub Date : 1969-12-01 DOI: 10.1016/S0021-9800(69)80061-X
Gerhard Ringel , J.W.T. Youngs
{"title":"Solution of the heawood map-coloring problem—Case 2","authors":"Gerhard Ringel ,&nbsp;J.W.T. Youngs","doi":"10.1016/S0021-9800(69)80061-X","DOIUrl":"https://doi.org/10.1016/S0021-9800(69)80061-X","url":null,"abstract":"<div><p>This paper gives a proof of the fact that the chromatic number of an orientable surface of genus <em>p</em> is equal to the integral part of <span><math><mrow><mo>(</mo><mn>7</mn><mo>+</mo><msqrt><mrow><mn>1</mn><mo>+</mo><mn>48</mn><mi>p</mi><mo>)</mo></mrow></msqrt><mo>/</mo><mn>2</mn></mrow></math></span> whenever the latter is congruent to 2 modulo 12.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 4","pages":"Pages 342-352"},"PeriodicalIF":0.0,"publicationDate":"1969-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80061-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91608873","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
A counterexample to the countable version of a conjecture of Ulam 乌兰猜想可数版本的反例
Journal of Combinatorial Theory Pub Date : 1969-12-01 DOI: 10.1016/S0021-9800(69)80063-3
Joshua Fisher
{"title":"A counterexample to the countable version of a conjecture of Ulam","authors":"Joshua Fisher","doi":"10.1016/S0021-9800(69)80063-3","DOIUrl":"https://doi.org/10.1016/S0021-9800(69)80063-3","url":null,"abstract":"","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 4","pages":"Pages 364-365"},"PeriodicalIF":0.0,"publicationDate":"1969-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80063-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91610974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
A note on a result of knuth or identities grow on trees 关于知识或身份的结果的注释长在树上
Journal of Combinatorial Theory Pub Date : 1969-12-01 DOI: 10.1016/S0021-9800(69)80066-9
Harvey D. Abramson
{"title":"A note on a result of knuth or identities grow on trees","authors":"Harvey D. Abramson","doi":"10.1016/S0021-9800(69)80066-9","DOIUrl":"https://doi.org/10.1016/S0021-9800(69)80066-9","url":null,"abstract":"<div><p>In this note a multinomial extension of a result of Knuth is presented which allows very simple proofs of complicated multinomial coefficient identities. Proofs are given of the “multinomial theorem” and of Hurwitz's generalization of Abel's identity, the latter a well-known generlization of the binomial theorem.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 4","pages":"Pages 371-373"},"PeriodicalIF":0.0,"publicationDate":"1969-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80066-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91636674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
On f-plentiful numbers 关于f丰数
Journal of Combinatorial Theory Pub Date : 1969-12-01 DOI: 10.1016/S0021-9800(69)80067-0
Walter E. Mientka, Roger C. Weitzenkamp
{"title":"On f-plentiful numbers","authors":"Walter E. Mientka,&nbsp;Roger C. Weitzenkamp","doi":"10.1016/S0021-9800(69)80067-0","DOIUrl":"https://doi.org/10.1016/S0021-9800(69)80067-0","url":null,"abstract":"","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 4","pages":"Pages 374-377"},"PeriodicalIF":0.0,"publicationDate":"1969-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80067-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91636676","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Solution of the heawood map-coloring problem—Case 8 heawood地图上色问题的解法——案例8
Journal of Combinatorial Theory Pub Date : 1969-12-01 DOI: 10.1016/S0021-9800(69)80062-1
Gerhard Ringel , J.W.T. Youngs
{"title":"Solution of the heawood map-coloring problem—Case 8","authors":"Gerhard Ringel ,&nbsp;J.W.T. Youngs","doi":"10.1016/S0021-9800(69)80062-1","DOIUrl":"10.1016/S0021-9800(69)80062-1","url":null,"abstract":"<div><p>This paper gives a proof of the fact that the chromatic number of an orientable surface of genus <em>p</em> is equal to the integral part of <span><math><mrow><mo>(</mo><mn>7</mn><mo>+</mo><msqrt><mrow><mn>1</mn><mo>+</mo><mn>48</mn><mi>p</mi><mo>)</mo></mrow></msqrt><mo>/</mo><mn>2</mn></mrow></math></span> whenever the latter s congruent to 8 modulo 12.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 4","pages":"Pages 353-363"},"PeriodicalIF":0.0,"publicationDate":"1969-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80062-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89343647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信