Journal article icon

Journal article

Dense subgraphs in random graphs

Abstract:

For a constant USD \gamma \in[0,1] USD and a graph USD G USD, let USD \omega_{\gamma}(G) USD be the largest integer USD k USD for which there exists a USD k USD-vertex subgraph of USD G USD with at least USD \gamma\binom{k}{2} USD edges. We show that if USD 0 Expand abstract

Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1016/j.dam.2019.01.032

Authors


More by this author
Institution:
University of Oxford
Department:
MATHEMATICAL INSTITUTE
Sub department:
Mathematical Institute
Oxford college:
Wadham College
Role:
Author
ORCID:
0000-0003-2696-0352
Publisher:
Elsevier Publisher's website
Journal:
Discrete Applied Mathematics Journal website
Volume:
260
Pages:
66-74
Publication date:
2019-03-11
Acceptance date:
2019-01-23
DOI:
ISSN:
0166-218X
Language:
English
Keywords:
Pubs id:
1131647
Local pid:
pubs:1131647
Deposit date:
2020-09-20

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