|
|
|
|
|
|
|
|||
| Év szerint | Hónap szerint | Ugrás a hónaphoz | |||||||
B.J. Roberts (LSE): A random graph analogue of the Andrasfai-Erdos-Sos problem |
|
|||
|
|
||||
|
||||
| Abstract. Andrasfai, Erdos and Sos proved that all triangle-free graphs with minimum degree strictly greater than 2n/5 are bipartite. We consider an adaptation of this result to a random graph setting and discuss some other random graph versions of classical results. | ||||
| Hely : Kalmár Intézet, Árpád tér, szemináriumi szoba | ||||
Esemény exportálása JEvents v3.1.8 Stable Copyright © 2006-2013