报告题目：Fundamental Graphs for Binary Matroids
报告人：周向前 教授 美国莱特州立大学
报告时间：7月23号（周二）上午10：00-11：00
地点；1218
摘要：
A matroid is a pair (E,I) where E is a finite set and I is a collection of subsets of E, called independent sets, such that 1) ∅ ∈ I; 2) if I ∈ I, then every subset of I also belongs to I; and 3) if I,J ∈ I such that |I| < |J|, then there exists x ∈ J such that I ∪ {x} ∈ I.It is clear that the set of columns in a matrix form a matroid, where a subset of columns is independent iff the columns are linearly independent. A matroid is binary if it comes from a matrix over GF(2). In this talk, we will show how to use bipartite graphs, called fundamental graphs, to represent binary matroids and to study the class of binary matroids without certain minors.
