找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復制鏈接]
查看: 55845|回復: 52
樓主
發(fā)表于 2025-3-21 18:23:18 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Combinatorial Mathematics V.
副標題Proceedings of the F
編輯Charles H. C. Little
視頻videohttp://file.papertrans.cn/230/229930/229930.mp4
叢書名稱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

您所在的用戶組沒有投票權限
沙發(fā)
發(fā)表于 2025-3-21 23:47:35 | 只看該作者
Latin squares composed of four disjoint subsquares,
板凳
發(fā)表于 2025-3-22 02:22:33 | 只看該作者
地板
發(fā)表于 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
5#
發(fā)表于 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
6#
發(fā)表于 2025-3-22 16:46:46 | 只看該作者
7#
發(fā)表于 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.
8#
發(fā)表于 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.).
9#
發(fā)表于 2025-3-23 05:27:41 | 只看該作者
10#
發(fā)表于 2025-3-23 06:26:43 | 只看該作者
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-11 01:44
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
柳河县| 陆川县| 金平| 清远市| 邻水| 南阳市| 庐江县| 枝江市| 临沂市| 定安县| 布尔津县| 犍为县| 上林县| 华亭县| 博野县| 东海县| 阜新市| 新巴尔虎左旗| 丰镇市| 峨边| 米易县| 广昌县| 鄂州市| 朔州市| 东乌| 墨脱县| 万年县| 隆昌县| 咸宁市| 山阳县| 洮南市| 新密市| 台江县| 三都| 阳西县| 二连浩特市| 静海县| 麻城市| 元阳县| 高平市| 香河县|