Counting results for sparse pseudorandom hypergraphs I

Publikationstyp

Journal Article

Date Issued

2017-10

Author(s)

Kohayakawa, Yoshiharu

Mota, Guilherme Oliveira

Schacht, Mathias

Institut

Mathematik E-10

TORE-URI

http://hdl.handle.net/11420/3830

Journal

European journal of combinatorics

Volume

65

Start Page

276

End Page

287

Citation

European Journal of Combinatorics (65): 276-287 (2017-10)

Publisher DOI

10.1016/j.ejc.2017.04.008

Scopus ID

2-s2.0-85019617679

We establish a so-called counting lemma that allows embeddings of certain linear uniform hypergraphs into sparse pseudorandom hypergraphs, generalizing a result for graphs (Kohayakawa et al., 2004). Applications of our result are presented in the companion paper (Counting results for sparse pseudorandom hypergraphs II).