Zhongtian He will present the General Exam "On the Network Coding Conjecture" on 5/13/24 at 1:30pm in CS 401. Committee Members: Mark Braverman(adviser). Huacheng Yu, and Ran Raz Abstract and Reading list can be found here: [ https://docs.google.com/document/d/11OJHqPsG2Su3-Kv-cASw1h7kPu34W2RxRXkPhh8M... | https://docs.google.com/document/d/11OJHqPsG2Su3-Kv-cASw1h7kPu34W2RxRXkPhh8M... ] While it's recognized that the utilization of network coding can greatly enhance the throughput of directed networks, an enduring open problem remains as to whether coding provides any advantage over the multicommodity flow (MCF) rate in undirected networks. It was conjectured by Li and Li in 2004 that the answer is ‘no’. We will present our recent progress on the conjecture.