"The largest hole in sparse random graphs."

Nemanja Draganic, Stefan Glock, Michael Krivelevich (2022)

> Home

Details and statistics

DOI: 10.1002/RSA.21078

access: open

type: Journal Article

metadata version: 2023-09-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/rsa/DraganicGK22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/DraganicGK22
Nemanja Draganic, Stefan Glock, Michael Krivelevich:
The largest hole in sparse random graphs. Random Struct. Algorithms 61(4): 666-677 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.