会议主题：Biased graphs and their associated matroids
会议时间：2021/11/29 16:00-17:00

腾讯会议：624-764-355
会议密码：2021

报告人：陈容，福州大学副研究员，博士生导师。主要研究方向为图论、拟阵、代数和组合。在J. Combin. Theory Ser. B，J. Graph Theory, SIAM J. Discrete Math., Adv. Appl. Math等一流专业期刊上发表论文10余篇。主持国家自然科学基金等项目多项。

摘要：A biased graph is a graph with a distinguished set of cycles (called balanced) with the property that any theta subgraph does not contain exactly two balanced cycles. The class of signed graphs is a special class of biased graphs. There are three classes of matroids defined using biased graphs, each of which generalises the class of graphic matroids and exhibits clear graph structure. In this talk, I will introduce some recent results, problems, and conjectures related to biased graphs and the three classes of matroids associated with them. No background on matroid theory is required for the audience.

欢迎广大师生参加！

数学科学学院