TUHH Open Research
Hilfe
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  • English
  • Deutsch
  • Communities & Collections
  • Publications
  • Research Data
  • People
  • Institutions
  • Projects
  • Statistics
  1. Home
  2. TUHH
  3. Publications without fulltext
  4. Counting results for sparse pseudorandom hypergraphs II
 
Options

Counting results for sparse pseudorandom hypergraphs II

Publikationstyp
Journal Article
Publikationsdatum
2017-10
Sprache
English
Author
Kohayakawa, Yoshiharu 
Mota, Guilherme Oliveira 
Schacht, Mathias 
Taraz, Anusch 
Institut
Mathematik E-10 
TORE-URI
http://hdl.handle.net/11420/3829
Enthalten in
European journal of combinatorics 
Volume
65
Start Page
288
End Page
301
Citation
European Journal of Combinatorics (65): 288-301 (2017-10)
Publisher DOI
10.1016/j.ejc.2017.04.007
Scopus ID
2-s2.0-85019625147
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).
TUHH
Weiterführende Links
  • Contact
  • Send Feedback
  • Cookie settings
  • Privacy policy
  • Impress
DSpace Software

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science
Design by effective webwork GmbH

  • Deutsche NationalbibliothekDeutsche Nationalbibliothek
  • ORCiD Member OrganizationORCiD Member Organization
  • DataCiteDataCite
  • Re3DataRe3Data
  • OpenDOAROpenDOAR
  • OpenAireOpenAire
  • BASE Bielefeld Academic Search EngineBASE Bielefeld Academic Search Engine
Feedback