|Computer Science/Discrete Mathematics Seminar I|
|Topic:||Clique Number of Random Geometric Graphs in High Dimension|
|Date:||Monday, January 21|
|Time/Room:||11:15am - 12:15pm/S-101|
In small dimension a random geometric graph behaves very differently from a standard Erdös-Rényi random graph. On the other hand, when the dimension tends to infinity (with the number of vertices being fixed) both models coincide. In this talk we study the behavior of the clique number of random geometric graphs when the dimension grows with the number of vertices.