Blow-up Lemma

被引:0
作者
János Komlós
Gábor N. Sárközy
Endre Szemerédi
机构
[1] Rutgers University,Department of Mathematics
[2] Rutgers University,Department of Computer Science
[3] Hungarian Academy of Sciences,undefined
来源
Combinatorica | 1997年 / 17卷
关键词
05 C 35;
D O I
暂无
中图分类号
学科分类号
摘要
Regular pairs behave like complete bipartite graphs from the point of view of bounded degree subgraphs.
引用
收藏
页码:109 / 123
页数:14
相关论文
共 27 条
[1]  
Alon N.(1993)Algorithmic aspects of the regularity lemma FOCS 33 479-481
[2]  
Duke R.(1984)Regular subgraphs of almost regular graphs J. Combinatorial Theory 37 79-91
[3]  
Leffman H.(1992)Almost Graphs and Combinatorics 8 95-102
[4]  
Rödl V.(1983)-factors in dense graphs Journal of Combinatorial Theory 34 239-243
[5]  
Yuster R.(1963)The Ramsey number of a graph with bounded maximum degree Acta Math. Acad. Sci. Hung. 14 423-439
[6]  
Alon N.(1954)On the maximal number of independent circuits in a graph Colloq. Math. 3 50-57
[7]  
Friedland S.(1946)On a problem of Zarankiewicz Bull. Amer. Math. Soc. 52 1089-1091
[8]  
Kalai G.(1995)On the structure of linear graphs Combinatorics, Probability and Computing 4 241-255
[9]  
Alon N.(1996)Proof of a packing conjecture of Bollobás, AMS Conference on Discrete Mathematics, DeKalb, Illinois (1993) Random Structures and Algorithms 9 193-211
[10]  
Yyster R.(undefined)On the square of a Hamiltonian cycle in dense graphs, Proceedings of Atlanta'95 undefined undefined undefined-undefined