设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
中国地质文献-英文(11)
SpringerLink电子期刊(88)
GSW全文库(3)
ACS电子期刊(2)
Wiley电子期刊(2)
ProQuest学位论文(13)
Elsevier电子期刊(157)
在“
Elsevier电子期刊
”中,
命中:
157
条,耗时:0.0169921 秒
在所有数据库中总计命中:
276
条
1.
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
2.
An upper bound for the size of a k-uniform
intersecting
family
with covering number k
作者:
Andrii Arman
a
;
armana@myumanitoba.ca
;
Troy Retter
b
;
1
;
tretter@emory.edu
关键词:
Intersecting
family
;
Intersecting
hypergraph
;
Covering number
;
Blocking number
;
Transversal
刊名:Journal of Combinatorial Theory, Series A
出版年: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.
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
5.
Around the Complete Intersection Theorem
作者:
Gyula O.H. Katona
ohkatona@renyi.hu
关键词:
Extremal combinatorics
;
Families of subsets
;
Intersecting
families
刊名:Discrete Applied Mathematics
出版年:2017
6.
On neighborhood-Helly graphs
作者:
Marina Groshaus
a
;
b
;
marinagroshaus@yahoo.es
;
Min Chih Lin
c
;
b
;
oscarlin@dc.uba.ar
;
Jayme L. Szwarcfiter
d
;
e
;
jayme@nce.ufrj.br
关键词:
Complexity
;
Extensions
;
Helly property
;
NP-hardness
刊名:Discrete Applied Mathematics
出版年:2017
7.
The Hilton-Milner theorem for the distance-regular graphs of bilinear forms
作者:
Chao Gong
201531130013@mail.bnu.edu.cn
;
Benjian Lv
;
bjlv@bnu.edu.cn
;
Kaishun Wang
wangks@bnu.edu.cn
关键词:
05D05
刊名:Linear Algebra and its Applications
出版年:2017
8.
Minimum size of feedback vertex sets of planar graphs of girth at least five
作者:
Tom Kelly
a
;
t9kelly@uwaterloo.ca
;
Chun-Hung Liu
b
;
chliu@math.princeton.edu
刊名:European Journal of Combinatorics
出版年:2017
9.
A non-trivial intersection theorem for permutations with fixed number of cycles
作者:
Cheng Yeaw Ku
a
;
matkcy@nus.edu.sg" class="auth_mail" title="E-mail the corresponding author
;
Kok Bin Wong
b
;
kbwong@um.edu.my" class="auth_mail" title="E-mail the corresponding author
关键词:
tt-
intersecting
family
;
Frankl&ndash
;
Hilton&ndash
;
Milner
;
Erdős&ndash
;
Ko&ndash
;
Rado
;
Permutations
刊名:Discrete Mathematics
出版年:2016
10.
Intersecting
faces of a simplicial complex via algebraic shifting
作者:
S.A. Seyed Fakhari
fakhari@khayam.ut.ac.ir" class="auth_mail" title="E-mail the corresponding author
关键词:
Simplicial complex
;
Erdős&ndash
;
Ko&ndash
;
Rado theorem
;
Algebraic shifting
;
ii-Near-cone
;
Sequentially Cohen&ndash
;
Macaulay simplicial complex
刊名:Discrete Mathematics
出版年:2016
1
2
3
4
5
6
7
8
9
按检索点细分(157)
题名(6)
关键词(29)
文摘(131)
按出版年细分(157)
2027年及以后(3)
2017年(8)
2016年(7)
2015年(2)
2014年(1)
2013年(9)
2012年(9)
2011年(11)
2010年(10)
2009年(12)
2008年(7)
2007年(11)
2006年(6)
2005年(11)
2004年(9)
2003年(3)
2002年(9)
2001年(7)
2000年(5)
2000年及以前(17)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.