搜索页_ Erdős&ndash

设为首页

收藏本站

网站地图 | English | 公务邮箱

About the library

Background
History
Leadership
Organization

Readers' Guide

Opening Hours
Collections
Help Via Email

Publications

Electronic Information Resources

外文资源

Elsevier电子期刊(42)

在“Elsevier电子期刊”中，命中：42条，耗时：0.061974 秒

在所有数据库中总计命中：44条

1.On the stability of some Erdős-Ko-Rado type results

作者：M.M. Pyaderkin ; ^{meshanya@gmail.com}

关键词：Random graph ; Kneser graph ; Intersecting family ; Erdős&ndash ; Ko&ndash ; Rado theorem

刊名：Discrete Mathematics

出版年：2017

2.Intersecting -uniform families containing a given family

作者：Jun Wang^a ; ^{jwang@shnu.edu.cn} ; Huajun Zhang^b ; ^{huajunzhang@zjnu.cn}

关键词：Family of sets ; Intersecting family ; Erdős&ndash ; Ko&ndash ; Rado theorem ; Hilton&ndash ; Milner theorem

刊名：Discrete Mathematics

出版年：2017

3.Towards extending the Ahlswede-Khachatrian theorem to cross -intersecting families

作者：Sang June Lee^a ; ^{sanglee242@duksung.ac.kr} ; Mark Siggers^b ; ^{mhsiggers@knu.ac.kr} ; Norihide Tokushige^c ; ^{hide@edu.u-ryukyu.ac.jp}

关键词：Cross intersecting families ; Erdős&ndash ; Ko&ndash ; Rado theorem ; Ahlswede&ndash ; Khachatrian theorem ; Shifting ; Random walks

刊名：Discrete Applied Mathematics

出版年：2017

4.Cross-intersecting pairs of hypergraphs

作者：Ron Aharoni^a ; ¹ ; ^{raharoni@gmail.com} ; David Howard^b ; ² ; ^{dmhoward@colgate.edu}

关键词：Cross-intersecting hypergraphs ; Erdős&ndash ; Ko&ndash ; Rado ; r-Partite hypergaphs ; Rainbow matchings

刊名：Journal of Combinatorial Theory, Series A

出版年：2017

5.Small cores in 3-uniform hypergraphs

作者：David Solymosi^a ; ^{solymosi@cs.toronto.edu} ; Jozsef Solymosi^b ; ^{solymosi@math.ubc.ca}

关键词：Cores in hypergraphs ; Brown&ndash ; Erdős&ndash ; Só ; s conjecture ; Hypergraph regularity

刊名：Journal of Combinatorial Theory, Series B

出版年：2017

6.Maximal -distance sets containing the representation of the Hamming graph

作者：Saori Adachi^a ; ^{k630945d@m2.aichi-c.ed.jp} ; Rina Hayashi^b ; Hiroshi Nozaki^c ; ^{hnozaki@auecc.aichi-edu.ac.jp} ; Chika Yamamoto^d

关键词：Hamming graph ; Few-distance set ; Euclidean representation ; Erdős&ndash ; Ko&ndash ; Rado theorem

刊名：Discrete Mathematics

出版年：2017

7.Clustering coefficients of large networks

作者：Yusheng Li ; Yilun Shang ; ^{shylmath@hotmail.com} ; ^{shyl@tongji.edu.cn} ; Yiting Yang

关键词：Clustering coefficient ; Theoretic graph ; Real-world network

刊名：Information Sciences

出版年：2017

8.Robustness of network controllability in cascading failure

作者：Shi-Ming Chen ; ^{c1977318@hotmail.com} ; Yun-Fei Xu ; Sen Nie

关键词：Structural controllability ; Cascading failure ; Edge capacity ; Complex networks

刊名：Physica A: Statistical Mechanics and its Applications

出版年：2017

9.Ramsey goodness of paths

作者：Alexey Pokrovskiy¹ ; ^{dr.alexey.pokrovskiy@gmail.com} ; Benny Sudakov¹ ; ^{benjamin.sudakov@math.ethz.ch}

关键词：Ramsey numbers ; Ramsey goodness ; Paths in graphs ; Expanders

刊名：Journal of Combinatorial Theory, Series B

出版年：2017

10.Hausdorff dimension of univoque sets and Devil's staircase

作者：Vilmos Komornik^a ; ^{komornik@math.unistra.fr" class="auth_mail" title="E-mail the corresponding author} ; Derong Kong^b ; ^{derongkong@126.com" class="auth_mail" title="E-mail the corresponding author} ; Wenxia Li^c ; ^{wxli@math.ecnu.edu.cn" class="auth_mail" title="E-mail the corresponding author}

关键词：primary ; 11A63 ; secondary ; 10K50 ; 11K55 ; 37B10 ; 28A80

刊名：Advances in Mathematics

出版年：2017

按检索点细分(42)

关键词(21)

文摘(33)

按出版年细分(42)

2017年(11)

2016年(24)

2015年(7)