Density theorems and extremal hypergraph problems
暂无分享,去创建一个
Mathias Schacht | Norihide Tokushige | Vojtěch Rödl | Eduardo Tengan | V. Rödl | M. Schacht | N. Tokushige | E. Tengan
[1] H. Furstenberg,et al. A density version of the Hales-Jewett theorem , 1991 .
[2] Terence Tao. A Quantitative Ergodic Theory Proof of Szemerédi's Theorem , 2006, Electron. J. Comb..
[3] H. Furstenberg. Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions , 1977 .
[4] W. T. Gowers,et al. Hypergraph regularity and the multidimensional Szemerédi theorem , 2007, 0710.3032.
[5] Vojtech Rödl,et al. Applications of the regularity lemma for uniform hypergraphs , 2006, Random Struct. Algorithms.
[6] E. Szemerédi. Regular Partitions of Graphs , 1975 .
[7] Jozef Skokan,et al. Applications of the regularity lemma for uniform hypergraphs , 2006 .
[8] Vojtech Rödl,et al. Regularity Lemma for k‐uniform hypergraphs , 2004, Random Struct. Algorithms.
[9] József Solymosi,et al. A Note on a Question of Erdős and Graham , 2004, Combinatorics, Probability and Computing.
[10] E. Szemerédi. On sets of integers containing k elements in arithmetic progression , 1975 .
[11] Vojtech Rödl,et al. The counting lemma for regular k‐uniform hypergraphs , 2006, Random Struct. Algorithms.
[12] W. T. Gowers,et al. A new proof of Szemerédi's theorem , 2001 .
[13] Vojtech Rödl,et al. Extremal problems on set systems , 2002, Random Struct. Algorithms.
[14] W. T. Gowers,et al. A NEW PROOF OF SZEMER ´ EDI'S THEOREM , 2001 .
[15] H. Furstenberg,et al. An ergodic Szemerédi theorem for IP-systems and combinatorial theory , 1985 .
[16] H. Furstenberg,et al. An ergodic Szemerédi theorem for commuting transformations , 1978 .
[17] V. Rödl,et al. The counting lemma for regular k-uniform hypergraphs , 2006 .