| Description |
Organizers: Ajay Gautam (ICTP-SISSA), Shubham Sinha (ICTP) Local organizers: Dipak Amgain, Shree Ram Khadka, Durga Khanal Topics: ● Introduction to Graph Theory (GT) ● Discrete maths and SAGE (SA) ● Analysis of algorithms in graph theory (AA) Speakers: 1. Arvind Ayyer (Indian Institute of Science Bangalore) (SA) 2. Lavanya Selvaganesh (Indian Institute of Technology BHU Varanasi) (GT) 3. Sruthi Sekar (Indian Institute of Technology, Bombay) (AA) Department: TU Central Dept. of Mathematics & Statistics https://maps.app.goo.gl/V3HtQRDQVGeBc9N49 Mini-courses for PWF Nepal Introduction to Graph Theory Speaker: Lavanya Selvaganesh Abstract: In this course, we will introduce the basic concepts of graphs. Connectedness, Eulerian and Hamiltonian graphs, and discuss some of the graph parameters, namely connectivity, independence number, coloring, and domination. Also, give a brief overview of how graphs are considered as data structures and discuss some graph algorithms (if time permits). Lecture days: Su Su M Tu Combinatorics through SageMath Speaker: Arvind Ayyer Abstract: I plan to cover basics of combinatorics interactively through SageMath, a free and open source computer algebra software. I will begin with counting problems in sets, multisets, permutations, partitions, trees and tableaux. I will go on to ordinary and exponential generating functions as well as the exponential formula. Finally, I will end with posets and the general Mobius inversion formula. Lecture days: M Tu We Th Design and Analysis Graph Algorthms Speaker: Sruthi Sekar Abstract: These lectures will introduce the fundamentals of graph algorithms and demonstrate their application to a range of problems. I will highlight recent breakthroughs in shortest path algorithms, outlining the key ideas behind them. In addition, I will showcase one or more concrete algorithms to illustrate the power and versatility of graph techniques. Finally, I will discuss a complementary facet of graph algorithms: while some problems admit efficient solutions, others are inherently difficult, and understanding these hard cases has deep connections to cryptography. Lecture days: We Th F F |
Material
Poster
PWF Nepal: School on Graph Theory
Go to day