Timeline for Reference for "almost all graphs have diameter 2"
Current License: CC BY-SA 3.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 3, 2012 at 14:03 | comment | added | Felix Goldberg | Thanks! I actually know this derivation, but I wanted a encapsulated reference to this precise fact. | |
Dec 3, 2012 at 13:58 | comment | added | Andreas Blass | The four Russians are Y.V. Glebskii, D.I. Kogan, M.I. Liogon'kii, and V.A. Talanov. The paper is "Range and degree of realizability of formulas in the restricted predicate calculus" [Kibernetika (Kiev) 1969, no.2, 17-28; translation in Cybenetics (Kiev) 5 (1969) 142-154]. I've been told that this paper is rather difficult to read. | |
Dec 3, 2012 at 13:55 | history | edited | Andreas Blass | CC BY-SA 3.0 |
added 1 characters in body
|
Dec 3, 2012 at 13:48 | history | answered | Andreas Blass | CC BY-SA 3.0 |