找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Horizons of Combinatorics; Ervin Győri,Gyula O. H. Katona,Gábor Sági Book 2008 Springer-Verlag Berlin Heidelberg 2008 Algorithms.Discrete

[复制链接]
查看: 43581|回复: 51
发表于 2025-3-21 17:18:32 | 显示全部楼层 |阅读模式
书目名称Horizons of Combinatorics
编辑Ervin Győri,Gyula O. H. Katona,Gábor Sági
视频video
丛书名称Bolyai Society Mathematical Studies
图书封面Titlebook: Horizons of Combinatorics;  Ervin Győri,Gyula O. H. Katona,Gábor Sági Book 2008 Springer-Verlag Berlin Heidelberg 2008 Algorithms.Discrete
描述.Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, combinatorial geometry as well. ..The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the conference "Horizons of Combinatorics" held in Balatonalmadi, Hungary in 2006. The collection gives a very good overview of recent trends and results in a large part of combinatorics and related topics, and offers an interesting reading for experienced specialists as well as to young researchers and students..
出版日期Book 2008
关键词Algorithms; Discrete Mathematics; Hypergraph; Hypergraphs; Infinite Combinatorics; Ramsey theory; Random S
版次1
doihttps://doi.org/10.1007/978-3-540-77200-2
isbn_softcover978-3-642-09589-4
isbn_ebook978-3-540-77200-2Series ISSN 1217-4696 Series E-ISSN 2947-9460
issn_series 1217-4696
copyrightSpringer-Verlag Berlin Heidelberg 2008
The information of publication is updating

书目名称Horizons of Combinatorics影响因子(影响力)




书目名称Horizons of Combinatorics影响因子(影响力)学科排名




书目名称Horizons of Combinatorics网络公开度




书目名称Horizons of Combinatorics网络公开度学科排名




书目名称Horizons of Combinatorics被引频次




书目名称Horizons of Combinatorics被引频次学科排名




书目名称Horizons of Combinatorics年度引用




书目名称Horizons of Combinatorics年度引用学科排名




书目名称Horizons of Combinatorics读者反馈




书目名称Horizons of Combinatorics读者反馈学科排名




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

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:29:07 | 显示全部楼层
发表于 2025-3-22 04:10:33 | 显示全部楼层
1217-4696 structures, combinatorial geometry as well. ..The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the conference "Horizons of Combinatorics" held in Balatonalmadi, Hungary in 2006. The collection gives a very good overview of recent trends an
发表于 2025-3-22 07:48:11 | 显示全部楼层
发表于 2025-3-22 09:09:40 | 显示全部楼层
发表于 2025-3-22 16:11:40 | 显示全部楼层
1217-4696 d results in a large part of combinatorics and related topics, and offers an interesting reading for experienced specialists as well as to young researchers and students..978-3-642-09589-4978-3-540-77200-2Series ISSN 1217-4696 Series E-ISSN 2947-9460
发表于 2025-3-22 18:06:05 | 显示全部楼层
发表于 2025-3-22 21:50:01 | 显示全部楼层
Combinatorial Conditions for the Rigidity of Tensegrity Frameworks, checked in polynomial time for the 1- and 2-dimensional frameworks, while the complexity questions are mainly open for higher dimensions. For surveys of such results the reader is referred to [., ., .].
发表于 2025-3-23 02:22:12 | 显示全部楼层
发表于 2025-3-23 08:03:10 | 显示全部楼层
,Erdős-Hajnal-type Results on Intersection Patterns of Geometric Objects,the property that every graph of . vertices that contains no induced subgraph isomorphic to . has a complete or an empty induced subgraph of size ..? We answer this question in the affirmative for some special classes of graphs denned by geometric methods.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-1 08:14
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表