Çankaya University - Math Student Colloquiums

Almost all finite graphs are asymmetric
Kübra Dölaslan
Orta Doğu Teknik Üniversitesi, Turkey
Özet : After preliminary definitions and lemmas about graphs and automorphisms, we will talk about the probability of finding a finite graph that has a nontrivial automorphism group; then prove that this probability is zero as number of vertices grow. This talk depends on an article by Ali Nesin in Matematik Dunyasi.
  Tarih : 15.03.2019
  Saat : 13:30
  Yer : Çankaya Üniversitesi, Merkez Kampüs, R-213
  Dil : English
  Ek Dosya : Özet
    Yazdır