Seminar Details
Take Shortcuts if you Must, but Make Them Few and Make Them Good!
- Start Date: March 6, 2024
- Event Start Time: 12:15 PM
- Event End Time: 1:15 PM
- Seminar Series: Graduate Combinatorics Seminar
- Presenter(s): Vikrant Ashvinkumar - Rutgers University
- Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
- Event Additional Info: <p>See: <a href="https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html">https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html</a></p>
- Presentation Type: Stand Alone Presentation
- Abstract:
Let G be an unweighted directed graph. You're permitted to add no more than a nearly linear number of extra “shortcut” edges to G, subject to their not violating the reachability relation already defined by G. How short are you able to make the longest shortest path between reachable pairs of vertices? What is this useful for? Let’s talk about it.
