Counting results for sparse pseudorandom hypergraphs II. (October 2017)
- Record Type:
- Journal Article
- Title:
- Counting results for sparse pseudorandom hypergraphs II. (October 2017)
- Main Title:
- Counting results for sparse pseudorandom hypergraphs II
- Authors:
- Kohayakawa, Yoshiharu
Mota, Guilherme Oliveira
Schacht, Mathias
Taraz, Anusch - Abstract:
- Abstract: 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).
- Is Part Of:
- European journal of combinatorics. Volume 65(2017)
- Journal:
- European journal of combinatorics
- Issue:
- Volume 65(2017)
- Issue Display:
- Volume 65, Issue 2017 (2017)
- Year:
- 2017
- Volume:
- 65
- Issue:
- 2017
- Issue Sort Value:
- 2017-0065-2017-0000
- Page Start:
- 288
- Page End:
- 301
- Publication Date:
- 2017-10
- Subjects:
- Combinatorial analysis -- Periodicals
Analyse combinatoire -- Périodiques
Combinatorial analysis
Periodicals
Electronic journals
511.6 - Journal URLs:
- http://www.sciencedirect.com/science/journal/01956698 ↗
http://www.elsevier.com/journals ↗
http://www.idealibrary.com ↗
http://firstsearch.oclc.org ↗
http://firstsearch.oclc.org/journal=0195-6698;screen=info;ECOIP ↗ - DOI:
- 10.1016/j.ejc.2017.04.007 ↗
- Languages:
- English
- ISSNs:
- 0195-6698
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3829.728200
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 4449.xml