Publisher DOI: 10.1016/j.ejc.2017.04.008
Title: Counting results for sparse pseudorandom hypergraphs I
Authors: Kohayakawa, Yoshiharu 
Mota, Guilherme Oliveira 
Schacht, Mathias 
Taraz, Anusch 
Issue Date: Oct-2017
Source: European Journal of Combinatorics (65): 276-287 (2017-10)
Abstract (english): 
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).
URI: http://hdl.handle.net/11420/3830
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

Page view(s)

68
Last Week
1
Last month
2
checked on Jun 27, 2022

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
checked on Jun 22, 2022

Google ScholarTM

Check

Add Files to Item

Note about this record

Cite this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.