Journal article icon

Journal article

Quasirandomness in hypergraphs

Abstract:

A graph G is called quasirandom if it possesses typical properties of the corresponding random graph G(n,p) with the same edge density as G. A well-known theorem of Chung, Graham and Wilson states that, in fact, many such ‘typical’ properties are asymptotically equivalent and, thus, a graph G possessing one property immediately satisfies the others. In recent years, more quasirandom graph properties have been found and extensions to hypergraphs have been explored. For the latter, however, the...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted manuscript

Actions


Access Document


Files:
Publisher copy:
10.1016/j.endm.2017.06.015

Authors


Aigner-Horev, E More by this author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Mathematical Institute
Oxford college:
Wadham College
Schacht, M More by this author
More from this funder
Funding agency for:
Conlon, D
Publisher:
Elsevier Publisher's website
Journal:
Electronic Notes in Discrete Mathematics Journal website
Volume:
61
Pages:
13-19
Publication date:
2017-08-03
Acceptance date:
2017-04-29
DOI:
ISSN:
1571-0653
Pubs id:
pubs:738683
URN:
uri:964937f4-93e2-47b0-9619-629e86f6f6d2
UUID:
uuid:964937f4-93e2-47b0-9619-629e86f6f6d2
Local pid:
pubs:738683
Keywords:

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP