Publisher DOI: 10.1016/j.endm.2015.07.070
Title: A counting lemma for sparse pseudorandom hypergraphs
Language: English
Authors: Kohayakawa, Yoshiharu 
Mota, Guilherme Oliveira 
Schacht, Mathias 
Taraz, Anusch 
Keywords: embeddings;hypergraphs;pseudorandomness
Issue Date: 2015
Publisher: Elsevier Science
Source: Electronic Notes in Discrete Mathematics (50): 421-426 (2015)
Abstract (english): 
We establish so-called counting lemmas that allow embeddings of certain hyper-graphs into sparse "pseudorandom" hypergraphs. As an application, we present a variant of a universality result of Rödl for sparse, 3-uniform hypergraphs contained in strongly pseudorandom hypergraphs.
Conference: LAGOS'15 – VIII Latin-American Algorithms, Graphs and Optimization Symposium 
URI: http://hdl.handle.net/11420/6365
ISSN: 1571-0653
Institute: Mathematik E-10 
Document Type: Article
Journal: Electronic notes in discrete mathematics 
Appears in Collections:Publications without fulltext

Show full item record

Page view(s)

61
Last Week
1
Last month
2
checked on Jun 27, 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.