A very sharp threshold for first order logic distinguishability of random graphs
A very sharp threshold for first order logic distinguishability of random graphs, Discrete Analysis 2025:6, 17 pp. Let $G_1$ and $G_2$ be two independent random graphs with $n$ vertices. The probability that they are isomorphic is very small, but they nevertheless share many important properties: t...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Diamond Open Access Journals
2025-07-01
|
| Series: | Discrete Analysis |
| Online Access: | https://doi.org/10.19086/da.138190 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|