Graph Powers and Capacities
The Shannon capacity of a channel, and its corresponding characteristic graph, is a well-studied parameter, with applications in Theoretical Computer Science, Information Theory and Combinatorics.
In this talk, I will survey results related to several types of graph powers, starting with the strong power and the Shannon capacity. The lecture will include the relevant definitions, as well as the consequences in Coding and Information Theory and Ramsey Theory.
Based on joint work with Noga Alon.
Speaker Details
Eyal Lubetzky received his B.Sc. degree in Mathematics and Computer Science (Summa Cum Laude) in 2002 from Tel-Aviv University, Israel. He is a Ph.D. student at the School of Mathematics in Tel Aviv University, under the supervision of Prof. Noga Alon. His research is partially supported by a Charles Clore Foundation Fellowship for Ph.D. students.
- Date:
- Speakers:
- Eyal Lubetzky
- Affiliation:
- Tel-Aviv University, Israel
-
-
Eyal Lubetzky
-
Jeff Running
-
