找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Mathematics V.; Proceedings of the F Charles H. C. Little Conference proceedings 1977 Springer-Verlag Berlin Heidelberg 1977

[复制链接]
查看: 55748|回复: 52
发表于 2025-3-21 18:23:18 | 显示全部楼层 |阅读模式
书目名称Combinatorial Mathematics V.
副标题Proceedings of the F
编辑Charles H. C. Little
视频video
丛书名称Lecture Notes in Mathematics
图书封面Titlebook: Combinatorial Mathematics V.; Proceedings of the F Charles H. C. Little Conference proceedings 1977 Springer-Verlag Berlin Heidelberg 1977
出版日期Conference proceedings 1977
关键词Counting; Kombinatorik; combinatorics; graph; mathematics; theorem
版次1
doihttps://doi.org/10.1007/BFb0069176
isbn_softcover978-3-540-08524-9
isbn_ebook978-3-540-37020-8Series ISSN 0075-8434 Series E-ISSN 1617-9692
issn_series 0075-8434
copyrightSpringer-Verlag Berlin Heidelberg 1977
The information of publication is updating

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




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




书目名称Combinatorial Mathematics V.网络公开度




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




书目名称Combinatorial Mathematics V.被引频次




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




书目名称Combinatorial Mathematics V.年度引用




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




书目名称Combinatorial Mathematics V.读者反馈




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




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

1票 100.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:47:35 | 显示全部楼层
Latin squares composed of four disjoint subsquares,
发表于 2025-3-22 02:22:33 | 显示全部楼层
发表于 2025-3-22 06:50:31 | 显示全部楼层
The knotted hexagon,al position in E.) be the set of vertices of some knotted hexagon, it is necessary that the convex hull K of the six points have six vertices (i.e. that no point lie inside the convex hull of the other five) and it is necessary and sufficient that K be of a certain combinatorial type, there being tw
发表于 2025-3-22 12:07:34 | 显示全部楼层
Sum-free sets in loops,he converse problem, of finding a sum-free partition and then obtaining the colouring looks like being much harder. Note also that there are still colourings of K. which cannot be obtained in this way. For example, if the colouring shown in Figure 7 were obtainabl from a loop {0,1,2,3,4,5} then thre
发表于 2025-3-22 16:46:46 | 显示全部楼层
发表于 2025-3-22 17:32:48 | 显示全部楼层
,A schröder triangle: Three combinatorial problems,. Three combinatorial interpretations of the sequences are given which are variants of interpretations of the Catalan numbers. The method of enumeration used is that of first or last passage decomposition. This leads to a renewal array having many of the properties of Pascal‘s triangle.
发表于 2025-3-23 01:06:19 | 显示全部楼层
Anne Germain,Rebecca Campbell,Ashlee McKeone elements, say {1,2,3} would have to be in one of the sum-free sets. But then {0,4,5} would, by 3.1, be a subloop, and so neither 0–4 nor 4–0 could belong to {1,2,3}. (However, Heinrich [4] has shown that this colouring can be embedded in a colouring of K. obtained from a sum-free partition of Z.).
发表于 2025-3-23 05:27:41 | 显示全部楼层
发表于 2025-3-23 06:26:43 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-25 02:01
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表