| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652699 | Electronic Notes in Discrete Mathematics | 2008 | 6 Pages |
Abstract
We found d1=d1(n,p) and d2=d2(n,p) such that almost every (random) graph G∈G(n,p) has retractions to d-dimensional octahedra Od for every integer d satisfying d1
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
