Journal article

Extremal results in sparse pseudorandom graphs

Publication status:: Published

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Conlon, D., Fox, J., & Zhao, Y. (2014). Extremal results in sparse pseudorandom graphs. ADVANCES IN MATHEMATICS, 256, 206–290.

MLA Style

Conlon, D., et al. “Extremal Results in Sparse Pseudorandom Graphs.” ADVANCES IN MATHEMATICS, vol. 256, 2014, pp. 206–90.

Chicago Style

Conlon, D, J Fox, and Y Zhao. 2014. “Extremal Results in Sparse Pseudorandom Graphs.” ADVANCES IN MATHEMATICS 256: 206–90.
Share
Print

Access Document

Publisher copy:: 10.1016/j.aim.2013.12.004

Authors

+ Conlon, D More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Mathematical Institute
Role:: Author

+ Fox, J More by this author

Role:: Author

+ Zhao, Y More by this author

Role:: Author

Journal:: ADVANCES IN MATHEMATICS More from this journal
Volume:: 256
Pages:: 206-290
Publication date:: 2014-05-01
DOI:: 10.1016/j.aim.2013.12.004
ISSN:: 0001-8708

Keywords:: Graph removal lemma

Counting lemma

Extremal combinatorics

Sparse regularity lemma

Sparse graphs

Szemeredi's regularity lemma
Pubs id:: pubs:356158
UUID:: uuid:e7517afc-c054-48f6-9a42-001c3118ee6d
Local pid:: pubs:356158
Source identifiers:: 356158
Deposit date:: 2014-05-23

Terms of use

Copyright date:: 2014

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

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

TO TOP