"How complex are random graphs in first order logic?"

Jeong Han Kim et al. (2005)

> Home

Details and statistics

DOI: 10.1002/RSA.20049

access: closed

type: Journal Article

metadata version: 2022-10-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/KimPSV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/KimPSV05
Jeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky:
How complex are random graphs in first order logic? Random Struct. Algorithms 26(1-2): 119-145 (2005)

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.