Description: | [DMS Seminar] Dr. Nishant Chandgotia (University of British Columbia) -- Finite diameter of the path space in Graphs |

Date: | Tuesday, Sep 01, 2015 |

Time: | 3 p.m. - 4 p.m. |

Venue: | G09, Lecture Hall Complex |

Details: | Fix a finite undirected graph H and two bi-infinite walks x and y in H. We say that x and y are adjacent if the ith step of x is adjacent to the ith step of y. x and y are said to be parallel if there exists a sequence x=x^1, x^2, …, x^n=y of paths such that x^j is adjacent to x^{j+1} for all j. Here the minimum number of steps n is called the parallelism distance between x and y. We wish to address the following question: When is the parallelism distance between paths in a graph bounded above? While we are not able to fully address the question, we do record some partial progress in this direction. |

Calendar: | Seminar Calendar (entered by arun.ds) |

Back to Calendar Delete this event Edit this event Upload Event Pics Copy this event View Slide