LARGE TRIANGLE-FREE SUBGRAPHS IN GRAPHS WITHOUT K4

被引：66
作者：
FRANKL, P
RODL, V
机构：
[1] CNRS, F-75007 PARIS, FRANCE
[2] CZECH TECH UNIV, FJFI, DEPT MATH, CS-11000 PRAGUE 1, CZECHOSLOVAKIA
[3] AT&T BELL LABS, MURRAY HILL, NJ 07974 USA
来源：
GRAPHS AND COMBINATORICS | 1986年 / 2卷 / 02期
关键词：
D O I：
10.1007/BF01788087
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：135 / 144
页数：10
相关论文
共 14 条
[1]  
Alon N., COMMUNICATION
[2]  
Bollobas B., 1978, EXTERMAL GRAPH THEOR
[3]   A MEASURE OF ASYMPTOTIC EFFICIENCY FOR TESTS OF A HYPOTHESIS BASED ON THE SUM OF OBSERVATIONS [J].
CHERNOFF, H .
ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (04) :493-507
[4]  
ERDOS P, 1983, C NUMERANTIUM, V39, P3
[5]  
Erdos P, 1975, RECENT ADV GRAPH THE, P183
[6]  
Erdos P., 1974, PROBABILISTIC METHOD
[7]   GRAPHS WITH MONOCHROMATIC COMPLETE SUBGRAPHS IN EVERY EDGE COLORING [J].
FOLKMAN, J .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1970, 18 (01) :19-&
[8]  
Goodman A.W., 1959, AM MATH MONTHLY, V66, P778
[9]  
GRAHAM RL, 1968, J COMBIN THEORY, V4, P300
[10]  
GRAHAM RL, 1981, REG C SER MATH, V45
12