The highly connected matroids in minor-closed classes (Q2343467): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Error-Correcting Capabilities of Cycle Codes of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Densities of minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some open problems on excluding a uniform matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projective geometries in dense matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth rates of minor-closed classes of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques in dense GF(\(q\))-representable matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minor-closed classes of matroids with exponential growth rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and optimization over cycles in binary matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear systems with integral valued solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Theory for Binary Linear Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial geometries representable over GF(3) and GF(q). I: The number of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth rate functions of dense classes of representable matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum-sized near-regular and \(\root 6\of{1}\)-matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Girth in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of computing the minimum distance of a code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased graphs. II: The three matroids / rank
 
Normal rank

Latest revision as of 00:45, 10 July 2024

scientific article
Language Label Description Also known as
English
The highly connected matroids in minor-closed classes
scientific article

    Statements

    The highly connected matroids in minor-closed classes (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2015
    0 references
    matroids
    0 references
    minors
    0 references
    connectivity
    0 references
    girth
    0 references
    linear codes
    0 references
    ML threshold function
    0 references
    growth rate
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references