November 7, 2019
10:20AM - 11:15AM
Math Tower 154
Add to Calendar
2019-11-07 11:20:00
2019-11-07 12:15:00
Combinatorics Seminar- Acan Huseyin
Title: Perfect matchings and Hamilton cycles in uniform attachment graphs
Speaker: Acan Huseyin - Drexel University
Abstract: A uniform attachment graph is a random graph on the vertex set {1,…,n}, where each vertex v makes k selections from {1,…,v-1} uniformly and independently, and these selections determine the edge set. (Here k is a parameter of the graph.) The threshold k-values for the existence of a perfect matching and the existence of a Hamilton cycle are still unknown for this graph. Improving the results of Frieze, Gimenez, Pralat and Reiniger (2019), we show that a uniform attachment graph has, with high probability, a perfect matching for k>4 and a Hamilton cycle for k> 12.
Math Tower 154
OSU ASC Drupal 8
ascwebservices@osu.edu
America/New_York
public
Date Range
Add to Calendar
2019-11-07 10:20:00
2019-11-07 11:15:00
Combinatorics Seminar- Acan Huseyin
Title: Perfect matchings and Hamilton cycles in uniform attachment graphs
Speaker: Acan Huseyin - Drexel University
Abstract: A uniform attachment graph is a random graph on the vertex set {1,…,n}, where each vertex v makes k selections from {1,…,v-1} uniformly and independently, and these selections determine the edge set. (Here k is a parameter of the graph.) The threshold k-values for the existence of a perfect matching and the existence of a Hamilton cycle are still unknown for this graph. Improving the results of Frieze, Gimenez, Pralat and Reiniger (2019), we show that a uniform attachment graph has, with high probability, a perfect matching for k>4 and a Hamilton cycle for k> 12.
Math Tower 154
Department of Mathematics
math@osu.edu
America/New_York
public
Title: Perfect matchings and Hamilton cycles in uniform attachment graphs
Speaker: Acan Huseyin - Drexel University
Abstract: A uniform attachment graph is a random graph on the vertex set {1,…,n}, where each vertex v makes k selections from {1,…,v-1} uniformly and independently, and these selections determine the edge set. (Here k is a parameter of the graph.) The threshold k-values for the existence of a perfect matching and the existence of a Hamilton cycle are still unknown for this graph. Improving the results of Frieze, Gimenez, Pralat and Reiniger (2019), we show that a uniform attachment graph has, with high probability, a perfect matching for k>4 and a Hamilton cycle for k> 12.
