Journal article icon

Journal article

How unproportional must a graph be?

Abstract:
Abstract Let uk(G,p) be the maximum over all k-vertex graphs F of by how much the number of induced copies of F in G differs from its expectation in the binomial random graph with the same number of vertices as G and with edge probability p. This may be viewed as a measure of how close G is to being p-quasirandom. For a positive integer n and 0
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1016/j.ejc.2018.05.007

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Oxford college:
Merton College
Role:
Author
ORCID:
0000-0003-4489-5988
More from this funder
Funding agency for:
Pikhurko, O
Grant:
EP/K012045/1
More from this funder
Funding agency for:
Pikhurko, O
Grant:
EP/K012045/1
Publisher:
Elsevier Publisher's website
Journal:
European Journal of Combinatorics Journal website
Volume:
73
Pages:
138–152
Publication date:
2018-06-20
Acceptance date:
2018-05-29
DOI:
EISSN:
1095-9971
ISSN:
0195-6698
Source identifiers:
856902
Pubs id:
pubs:856902
UUID:
uuid:a52fc9da-7251-4987-8ab8-0b7349dd82cf
Local pid:
pubs:856902
Deposit date:
2018-06-11

Terms of use


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