Journal article
Rational exponents in extremal graph theory
- Abstract:
- Given a family of graphs H, the extremal number ex(n;H) is the largest m for which there exists a graph with n vertices and m edges containing no graph from the family H as a subgraph. We show that for every rational number r between 1 and 2, there is a family of graphs Hr such that ex(n;Hr) = 0(nr). This solves a longstanding problem in the area of extremal graph theory.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 277.4KB, Terms of use)
-
- Publisher copy:
- 10.4171/JEMS/798
Authors
- Publisher:
- European Mathematical Society
- Journal:
- Journal of the European Mathematical Society More from this journal
- Volume:
- 20
- Issue:
- 7
- Pages:
- 1747–1757
- Publication date:
- 2018-05-22
- Acceptance date:
- 2017-10-23
- DOI:
- EISSN:
-
1435-9863
- ISSN:
-
1435-9855
- Pubs id:
-
pubs:742140
- UUID:
-
uuid:209a8a44-fe9f-48b9-bd2c-74440ea0fd18
- Local pid:
-
pubs:742140
- Source identifiers:
-
742140
- Deposit date:
-
2017-11-01
- ARK identifier:
Terms of use
- Copyright holder:
- © European Mathematical Society 2018
- Copyright date:
- 2018
- Notes:
- This is the author accepted manuscript following peer review version of the article. The final version is available online from European Mathematical Society at: 10.4171/JEMS/798
If you are the owner of this record, you can report an update to it here: Report update to this record