stability;
supersaturation;
Turá
n number;
MAXIMUM NUMBER;
PENTAGONS;
D O I:
10.1002/jgt.22652
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Fix a graph F. We say that a graph is F-free if it contains no copy of F as a subgraph. Let ex(n,H,F) denote the maximum number of copies of a graph H in an n-vertex F-free graph. In this note, we will give a new general supersaturation result for ex(n,H,F) in the case when chi(H)<chi(F) as well as a new proof of a stability theorem for ex(n,Kr,F).
机构:
ELKH, Alfred Reny Inst Math, Budapest, Hungary
Nanjing Univ, Dept Math, Nanjing, Peoples R ChinaELKH, Alfred Reny Inst Math, Budapest, Hungary
Zhu, Xiutao
Györi, Ervin
论文数: 0引用数: 0
h-index: 0
机构:
ELKH, Alfred Reny Inst Math, Budapest, HungaryELKH, Alfred Reny Inst Math, Budapest, Hungary
Györi, Ervin
He, Zhen
论文数: 0引用数: 0
h-index: 0
机构:
ELKH, Alfred Reny Inst Math, Budapest, Hungary
Tsinghua Univ, Dept Math Sci, Beijing, Peoples R ChinaELKH, Alfred Reny Inst Math, Budapest, Hungary
He, Zhen
Lv, Zequn
论文数: 0引用数: 0
h-index: 0
机构:
ELKH, Alfred Reny Inst Math, Budapest, Hungary
Tsinghua Univ, Dept Math Sci, Beijing, Peoples R ChinaELKH, Alfred Reny Inst Math, Budapest, Hungary
Lv, Zequn
Salia, Nika
论文数: 0引用数: 0
h-index: 0
机构:
ELKH, Alfred Reny Inst Math, Budapest, Hungary
Inst for Basic Sci Korea, Extremal Combinator & Probabil Grp, Daejeon, South KoreaELKH, Alfred Reny Inst Math, Budapest, Hungary
Salia, Nika
Xiao, Chuanqi
论文数: 0引用数: 0
h-index: 0
机构:
ELKH, Alfred Reny Inst Math, Budapest, Hungary
RDFZ Xishan Sch, Beijing, Peoples R ChinaELKH, Alfred Reny Inst Math, Budapest, Hungary
机构:
MTA ELTE Geometr & Algebra Combinator Res Grp, H-1117 Budapest, Hungary
Hungarian Acad Sci, Alfred Renyi Inst Math, H-1053 Budapest, HungaryMTA ELTE Geometr & Algebra Combinator Res Grp, H-1117 Budapest, Hungary