Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

74

Voted

JCT
2006

54views more JCT 2006»

Matroid packing and covering with circuits through an element

15 years 2 months ago

Matroid packing and covering with circuits through an element

Download www.math.lsu.edu

Abstract. In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the maximum number of disjoint circuits and

Manoel Lemos, James G. Oxley

Real-time Traffic

Connected Matroid | Disjoint Circuits | JCT 2006 | Maximum Number |

claim paper

Related Content

» Cycle Cover Ratio of Regular Matroids

» LAP a logic activity packing methodology for leakage powertolerant FPGAs

» Fully Homomorphic Encryption with Polylog Overhead

» A Convex Programming Approach to Positive Real Rational Approximation

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JCT
Authors	Manoel Lemos, James G. Oxley

Comments (0)