论文信息 - Counting results for sparse pseudorandom hypergraphs II

Counting results for sparse pseudorandom hypergraphs II

We present a variant of a universality result of Rödl [On universality of graphs with uniformly distributed edges, Discrete Math. 59 (1986), no. 1-2, 125–134] for sparse, 3-uniform hypergraphs contained in strongly jumbled hypergraphs. One of the ingredients of our proof is a counting lemma for fixed hypergraphs in sparse “pseudorandom” uniform hypergraphs, which is proved in the companion paper [Counting results for sparse pseudorandom hypergraphs I]. §

[1] Yoshiharu Kohayakawa,et al. Szemerédi’s Regularity Lemma and Quasi-randomness , 2003 .

[2] Vojtech Rödl,et al. Embedding tetrahedra into quasirandom hypergraphs , 2016, J. Comb. Theory, Ser. B.

[3] Fan Chung Graham,et al. Quasi‐random graphs with given degree sequences , 2008, Random Struct. Algorithms.

[4] A. Shapira,et al. Extremal Graph Theory , 2013 .

[5] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.

[6] Fan Chung Graham,et al. Sparse Quasi-Random Graphs , 2002, Comb..

[7] Yoshiharu Kohayakawa,et al. Counting results for sparse pseudorandom hypergraphs I , 2016, Eur. J. Comb..

[8] Fan Chung Graham,et al. Quasi-random graphs , 1988, Comb..

[9] Paul Erdös,et al. Some old and new problems in various branches of combinatorics , 1997, Discret. Math..

[10] B. Sudakov,et al. Pseudo-random Graphs , 2005, math/0503745.

[11] Vladimir Nikiforov. On The Edge Distribution Of A Graph , 2001, Comb. Probab. Comput..

[12] R. Graham,et al. Quasi-random graphs with given degree sequences , 2008 .

[13] Vojtech Rödl. On universality of graphs with uniformly distributed edges , 1986, Discret. Math..

[14] John Lenz,et al. The poset of hypergraph quasirandomness , 2012, Random Struct. Algorithms.

[15] V. Rödl,et al. On The Triangle Removal Lemma For Subgraphs of Sparse Pseudorandom Graphs , 2010 .

[16] Henry Towsner,et al. σ‐algebras for quasirandom hypergraphs , 2017, Random Struct. Algorithms.