On the number of common bases of two matroids (Q794657): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jean Fonlupt / rank
Normal rank
 
Property / author
 
Property / author: Jean Fonlupt / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Constraints in Convex Control Problems of Bolza / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(83)90038-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070835108 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:30, 30 July 2024

scientific article
Language Label Description Also known as
English
On the number of common bases of two matroids
scientific article

    Statements

    On the number of common bases of two matroids (English)
    0 references
    0 references
    0 references
    1983
    0 references
    Let \(M_ i=(E,F_ i)\), \(i=1,2\), be two simple matroids on the same finite set E \((F_ i\) being the family of independent sets for \(M_ i)\). By studying the dimension of the intersection of the polytope \(K(M_ i)\) representing \(M_ i\), \(i=1,2\), (that is, \(K(M_ i)\) is the polytope having as extreme points the representative vectors of the bases of \(M_ i)\), the authors obtain \(| E| -(d_ 1+d_ 2)+2\) for the least number of common bases of \(M_ 1\) and \(M_ 2\), assuming there exists at least one basis in common, where \(d_ i\) is the index of decomposition of \(M_ i\). A number of interesting applications to graph theory are given.
    0 references
    bases
    0 references
    bipartite matching
    0 references
    directed spanning trees
    0 references
    index of decomposition
    0 references

    Identifiers