Structural and extremal properties of graphs and hypergraphs
Quasi-random hypergraphs and spanning subhypergraph containment
Deep learning and intermediate representations for pediatric image analysis
| Full text | |
| Author(s): |
Kohayakawa, Yoshiharu
;
Mota, Guilherme Oliveira
;
Schacht, Mathias
;
Taraz, Anusch
Total Authors: 4
|
| Document type: | Journal article |
| Source: | EUROPEAN JOURNAL OF COMBINATORICS; v. 65, p. 288-301, OCT 2017. |
| Web of Science Citations: | 1 |
| Abstract | |
We present a variant of a universality result of Roth (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). (C) 2017 Elsevier Ltd. All rights reserved. (AU) | |
| 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/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/11431-2 - Extremal and probabilistic combinatorics |
| Grantee: | Guilherme Oliveira Mota |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 13/20733-2 - Extremal and probabilistic combinatorics |
| Grantee: | Guilherme Oliveira Mota |
| Support Opportunities: | Scholarships abroad - Research Internship - Post-doctor |