• Students
  • Faculty & Staff
  • Visitor
  • 中文
  • search
  • Home
  • About
  • Admission
  • Research
  • News & Events
  • Schools
Home About Admission Research News & Events Schools Students Faculty & Staff Visitor 中文
search
Induction for 4-connected Matroids and Graphs
Date:2017-06-14 
Speaker:Xiangqian Zhou (Joe)

Time: 2017-6-14 16:30-17:30

Place: Room 1518,School of Mathematical Sciences

Detail:

Wright State University, Dayton Ohio USA and Huaqiao University, Quanzhou Fujian China A matroid M is a pair (E, I) where E is a finite set, called the ground set of M, and I is a non-empty collection of subsets of E, called independent sets of M, such that (1) a subset of an independent set is independent; and (2) if I and J are independent sets with |I| < |j|, then exists x ∈ j/i such that i ∪ {x} is independent. a graph g gives rise to a matroid m(g) where the ground set is e(g) and a subset of e(g) is independent if it spans a forest. another example is a matroid that comes from a matrix over a field f: the ground set e is the set of all columns and a subset of e is independent if it is linearly independent over f. tutte’s wheel and whirl theorem and seymour’s splitter theorem are two well-known inductive tools for proving results for 3-connected graphs and matroids. in this talk, we will give a survey on induction theorems for various versions of matroid 4-connectivity.

Organizer: School of Mathematical Sciences
Quick Links
Hotline
Campus View
Dictionary
Video Course
Library
Services
Campus Areas Maps
On Campus Societies
Dining Centers
Sports Center
Hospital
Join Us
Join Us
Teacher Recruitment

Address: University of Science and Technology of China,
No.96, JinZhai Road Baohe District, Hefei, Anhui, 230026, P.R.China.

E-mail: OIC@ustc.tsg211.com

Copyright © 2013 University of Science and Technology of China.