×

Euler and bipartite matroids. (English) Zbl 0169.01901

Summary: We show that for binary matroids the properties of being Euler and bipartite are dual concepts, thus generalizing Euler’s theorem for graphs.

MSC:

05B35 Combinatorial aspects of matroids and geometric lattices
PDFBibTeX XMLCite
Full Text: DOI