Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
暂无分享,去创建一个
[1] Vojtech Rödl,et al. Embedding tetrahedra into quasirandom hypergraphs , 2016, J. Comb. Theory, Ser. B.
[2] C. Reiher,et al. On a Turán problem in weakly quasirandom 3-uniform hypergraphs , 2016, 1602.02290.
[3] Yoshiharu Kohayakawa,et al. Hypergraphs, Quasi-randomness, and Conditions for Regularity , 2002, J. Comb. Theory, Ser. A.
[4] Paul Erdös,et al. On Ramsey—Turán type theorems for hypergraphs , 1982, Comb..
[5] V. Rödl,et al. Extremal problems on set systems , 2002 .
[6] Vojtech Rödl,et al. Regular Partitions of Hypergraphs: Counting Lemmas , 2007, Combinatorics, Probability and Computing.
[7] P. Erdös. On extremal problems of graphs and generalized graphs , 1964 .
[8] Vojtech Rödl,et al. Regular Partitions of Hypergraphs: Regularity Lemmas , 2007, Combinatorics, Probability and Computing.
[9] Vojtech Rödl,et al. Some Ramsey-Turán type results for hypergraphs , 1988, Comb..
[10] Vojtech Rödl,et al. Hypergraph regularity and quasi-randomness , 2009, SODA.
[12] P. Erdös. Problems and Results on Graphs and Hypergraphs: Similarities and Differences , 1990 .
[13] Vojtech Rödl. On universality of graphs with uniformly distributed edges , 1986, Discret. Math..
[14] Yoshiharu Kohayakawa,et al. Weak hypergraph regularity and linear hypergraphs , 2010, J. Comb. Theory, Ser. B.
[15] W. T. Gowers,et al. Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs , 2006, Combinatorics, Probability and Computing.
[16] Vojtech Rödl,et al. Extremal problems on set systems , 2002, Random Struct. Algorithms.