Counting results for sparse pseudorandom hypergraphs I

Author(s)

Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias ; Taraz, Anusch

• Document type: Journal article
• Source: EUROPEAN JOURNAL OF COMBINATORICS; v. 65, p. 276-287, OCT 2017.
• Web of Science Citations: 1

Abstract

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). (C) 2017 Elsevier Ltd. All rights reserved. (AU)

• FAPESP's process: 09/06294-0 - Asymptotic combinatorics of sparse structures and regularity
• Grantee: Guilherme Oliveira Mota
• Support Opportunities: Scholarships in Brazil - Doctorate
• FAPESP's process: 13/07699-0 - Research, Innovation and Dissemination Center for Neuromathematics - NeuroMat
• Grantee: Oswaldo Baffa Filho
• Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
• FAPESP's process: 13/20733-2 - Extremal and probabilistic combinatorics
• Grantee: Guilherme Oliveira Mota
• Support Opportunities: Scholarships abroad - Research Internship - Post-doctor
• FAPESP's process: 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science
• Grantee: Carlos Eduardo Ferreira
• Support Opportunities: Research Projects - Thematic Grants
• FAPESP's process: 13/11431-2 - Extremal and probabilistic combinatorics
• Grantee: Guilherme Oliveira Mota
• Support Opportunities: Scholarships in Brazil - Post-Doctoral