한국수학교육학회지시리즈A:수학교육 (The Mathematical Education)
- 제12권2호
- /
- Pages.1-4
- /
- 1974
- /
- 1225-1380(pISSN)
- /
- 2287-9633(eISSN)
Matroid와 Graph에 대하여
초록
Matroid theory, which was first introduced in 1935 by Whitney (2), is a branch of combinational mathematics which has some very much to the fore in the last few years. H. Whitney had just spent several years working in the field of graph theory, and had noticed several similarities between the ideas of independence and rank in graph theory and those of linear independence and dimension in the study of vector spaces. A matroid is essentially a set with some kind of 'independence structure' defined on it. There are several known results concerning how matroids can be induced from given matroid by a digraph. The purpose of this note is to show that, given a matroid M
키워드