找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Mathematics VII; Proceedings of the S Robert W. Robinson,George W. Southern,Walter D. Wa Conference proceedings 1980 Springer

[复制链接]
查看: 21457|回复: 58
发表于 2025-3-21 18:49:25 | 显示全部楼层 |阅读模式
书目名称Combinatorial Mathematics VII
副标题Proceedings of the S
编辑Robert W. Robinson,George W. Southern,Walter D. Wa
视频video
丛书名称Lecture Notes in Mathematics
图书封面Titlebook: Combinatorial Mathematics VII; Proceedings of the S Robert W. Robinson,George W. Southern,Walter D. Wa Conference proceedings 1980 Springer
出版日期Conference proceedings 1980
关键词Hypergraph; Kombinatorik; Mathematics; Ramsey theory; algorithms; graphs; combinatorics
版次1
doihttps://doi.org/10.1007/BFb0088895
isbn_softcover978-3-540-10254-0
isbn_ebook978-3-540-38376-5Series ISSN 0075-8434 Series E-ISSN 1617-9692
issn_series 0075-8434
copyrightSpringer-Verlag Berlin Heidelberg 1980
The information of publication is updating

书目名称Combinatorial Mathematics VII影响因子(影响力)




书目名称Combinatorial Mathematics VII影响因子(影响力)学科排名




书目名称Combinatorial Mathematics VII网络公开度




书目名称Combinatorial Mathematics VII网络公开度学科排名




书目名称Combinatorial Mathematics VII被引频次




书目名称Combinatorial Mathematics VII被引频次学科排名




书目名称Combinatorial Mathematics VII年度引用




书目名称Combinatorial Mathematics VII年度引用学科排名




书目名称Combinatorial Mathematics VII读者反馈




书目名称Combinatorial Mathematics VII读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:39:03 | 显示全部楼层
https://doi.org/10.1007/978-3-642-69659-6se numbers as n → ∞ is determined. Similar results are obtained for the mean and variance of the number of points in a phylogenetic tree with n labels. The effect of requiring that each nonempty label be a singleton is also studied.
发表于 2025-3-22 02:08:20 | 显示全部楼层
W. Dement,W. Seidel,M. Carskadonthere are only two vertex degrees, and the vertices of each degree induce a regular subgraph of G. The eigenvalues of each of these subgraphs determine the eigenvalues of the other. We are able to construct non-trivial NR-regular graphs with 4, 8, 28 and 32 vertices, and conjecture that there are infinitely many more.
发表于 2025-3-22 07:13:04 | 显示全部楼层
发表于 2025-3-22 11:50:27 | 显示全部楼层
https://doi.org/10.1007/978-3-642-69659-6rbitrary parameters 0
发表于 2025-3-22 14:20:20 | 显示全部楼层
发表于 2025-3-22 20:13:01 | 显示全部楼层
Degree sequences uniquely realisable by hypergraphs,d let F(s.) be the corresponding set for s.-hypergraphs. Hakimi determined F(2), and F(s) can be derived from a result of Koren. Here we determine F(2.) and show that the "graph of 2.-realisations" of any sequence is connected.
发表于 2025-3-23 00:49:20 | 显示全部楼层
An approximation algorithm for computing the permanent,rbitrary parameters 0
发表于 2025-3-23 03:21:32 | 显示全部楼层
The incidence algebra of a group reduced partially ordered set,rbit B if there exist elements a ε A and b ε B with a⩽b. We show that . (P(G)), the incidence algebra of P(G), is the homomorphic image of a subalgebra of .(P) via a Polya-type homomorphism. We compute a natural inverse image for each function of .(P(G)) and in particular for the Möbius function of P(G).
发表于 2025-3-23 05:31:35 | 显示全部楼层
Pseudographic realizations of an infinitary degree sequence, the components of such graphs of realizations have already been obtained. We add to these results here and, in particular, determine all cases in which the graph has a component which is a path, and all cases in which it has an endvertex.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-23 14:18
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表