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
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, 310.2KB)
-
- Publisher copy:
- 10.1016/j.dam.2019.01.032
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- 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
Item Description
Terms of use
- Copyright holder:
- Elsevier
- Copyright date:
- 2019
- Rights statement:
- © 2019 Elsevier B.V. All rights reserved.
- Notes:
- This is the accepted manuscript version of the article. The final version is available from Elsevier at: https://doi.org/10.1016/j.dam.2019.01.032
If you are the owner of this record, you can report an update to it here: Report update to this record