设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Wiley电子期刊(6)
SpringerLink电子期刊(72)
Elsevier电子期刊(195)
Springer电子图书(1)
ProQuest学位论文(1)
在“
Elsevier电子期刊
”中,
命中:
195
条,耗时:0.043979 秒
在所有数据库中总计命中:
275
条
1.
Supersaturation problem for color-critical
graph
s
作者:
Oleg Pikhurko
a
;
1
;
O.Pikhurko@warwick.ac.uk
;
Zelealem B. Yilma
b
;
zyilma@qatar.cmu.edu
关键词:
Extremal
graph
theory
;
Removal lemma
;
Supersaturation
;
Turá
;
n function
刊名:Journal of Combinatorial
Theory
, Series B
出版年:2017
2.
Variable Neighborhood Search for
extremal
vertices : The Auto
Graph
iX-III system
作者:
Gilles Caporossi
gilles.caporossi@gerad.ca
关键词:
Variable neighbourhood search
;
Graph
theory
;
Extremal
graph
s
;
Auto
Graph
iX
刊名:Computers & Operations Research
出版年:2017
3.
Extremal
H-colorings of trees and 2-connected
graph
s
作者:
John Engbers
a
;
1
;
john.engbers@marquette.edu
;
David Galvin
b
;
2
;
dgalvin1@nd.edu
关键词:
Graph
homomorphisms
;
H-coloring
;
Graph
coloring
;
Widom&ndash
;
Rowlinson model
;
London&ndash
;
Hoffman inequality
;
2-connected
graph
s
刊名:Journal of Combinatorial
Theory
, Series B
出版年:2017
4.
Counting and packing Hamilton cycles in dense
graph
s and oriented
graph
s
作者:
Asaf Ferber
a
;
asaf.ferber@yale.edu
;
Michael Krivelevich
b
;
1
;
krivelev@post.tau.ac.il
;
Benny Sudakov
c
;
2
;
benjamin.sudakov@math.ethz.ch
关键词:
Hamilton cycles
;
Oriented
graph
s
;
Packing
;
Counting
刊名:Journal of Combinatorial
Theory
, Series B
出版年:2017
5.
On edges not in monochromatic copies of a fixed bipartite
graph
作者:
Jie Ma
1
;
jiema@ustc.edu.cn
关键词:
Turá
;
n number
;
Bipartite
graph
;
Monochromatic copies of H
;
2-Edge-coloring of KnKn
;
Weak vertex
刊名:Journal of Combinatorial
Theory
, Series B
出版年:2017
6.
Proof of a conjecture on monomial
graph
s
作者:
Xiang-dong Hou
a
;
xhou@usf.edu
;
Stephen D. Lappano
a
;
slappano@mail.usf.edu
;
Felix Lazebnik
b
;
fellaz@udel.edu
刊名:Finite Fields and Their Applications
出版年:2017
7.
An
extremal
problem for vertex partition of complete multipartite
graph
s
作者:
Tomoki Nakamigawa
nakami@info.shonan-it.ac.jp" class="auth_mail" title="E-mail the corresponding author
关键词:
Extremal
graph
theory
;
Graph
Ramsey
theory
;
Graph
decomposition
刊名:Discrete Mathematics
出版年:2016
8.
Diameter critical
graph
s
作者:
Po-Shen Loh
a
;
1
;
ploh@cmu.edu" class="auth_mail" title="E-mail the corresponding author
;
Jie Ma
b
;
jiema@ustc.edu.cn" class="auth_mail" title="E-mail the corresponding author
关键词:
Diameter
;
Critical
;
Murty&ndash
;
Simon conjecture
;
Extremal
graph
theory
刊名:Journal of Combinatorial
Theory
, Series B
出版年:2016
9.
Many T copies in H-free
graph
s
作者:
Noga Alon
a
;
b
;
1
;
nogaa@tau.ac.il" class="auth_mail" title="E-mail the corresponding author
;
Clara Shikhelman
c
;
2
;
clarashk@mail.tau.ac.il" class="auth_mail" title="E-mail the corresponding author
关键词:
Extremal
graph
theory
;
H-free
graph
s
;
Projective norm
graph
s
;
Complete
graph
s
;
Complete bipartite
graph
s
刊名:Journal of Combinatorial
Theory
, Series B
出版年:2016
10.
Short proofs of some
extremal
results II
作者:
David Conlon
a
;
1
;
david.conlon@maths.ox.ac.uk" class="auth_mail" title="E-mail the corresponding author
;
Jacob Fox
b
;
2
;
jacobfox@stanford.edu" class="auth_mail" title="E-mail the corresponding author
;
Benny Sudakov
c
;
3
;
benjamin.sudakov@math.ethz.ch" class="auth_mail" title="E-mail the corresponding author
关键词:
Extremal
combinatorics
;
Ramsey problems
刊名:Journal of Combinatorial
Theory
, Series B
出版年:2016
1
2
3
4
5
6
7
8
9
按检索点细分(195)
题名(3)
关键词(67)
文摘(73)
按出版年细分(195)
2027年及以后(10)
2017年(6)
2016年(12)
2015年(12)
2013年(15)
2012年(4)
2011年(14)
2010年(8)
2009年(18)
2008年(17)
2007年(15)
2006年(11)
2005年(8)
2004年(9)
2003年(9)
2002年(3)
2001年(3)
2000年(7)
2000年及以前(14)
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
.