|Publisher DOI:||10.1016/j.ejc.2017.04.007||Title:||Counting results for sparse pseudorandom hypergraphs II||Language:||English||Authors:||Kohayakawa, Yoshiharu
Mota, Guilherme Oliveira
|Issue Date:||Oct-2017||Source:||European Journal of Combinatorics (65): 288-301 (2017-10)||Abstract (english):||
We present a variant of a universality result of Rödl (1986) 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” hypergraphs, which is proved in the companion paper (Counting results for sparse pseudorandom hypergraphs I).
|URI:||http://hdl.handle.net/11420/3829||ISSN:||1095-9971||Institute:||Mathematik E-10||Document Type:||Article||Journal:||European journal of combinatorics|
|Appears in Collections:||Publications without fulltext|
Show full item record
checked on Jun 27, 2022
checked on Jun 21, 2022
Add Files to Item
Note about this record
Cite this record
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.