腾讯会议：693140506， 6月24日19：00
邀请人：张晓岩教授
摘要：This talk serves as a brief introduction to the Shannon capacity of graphs.Concepts of the Shannon capacity and the theta function are mainly covered. We also give two representations of a graph and their properties and a lower bound on the Shannon capacity of union of a graph and its complement.
报告人简介：高锁刚，河北师范大学网赌
教授、博士生导师，主要从事典型群、代数组合论、组合优化等方面的研究，在J. Combin. Theory A、 J. Algebraic Combin.、 European J. Combin.、J. Global Optim.、Theoret. Comput. Sci. 等国内外核心期刊发表论文90余篇。在科学出版社出版一部专著《距离正则图及其相关代数》，担任Discrete Math. Algorithms Appl.杂志编委。主持三项国家自然科学基金、一项教育部博士点基金、两项河北省自然科学基金。作为第一完成人获河北省科学技术奖二等奖1项、三等奖1项。
