
doi: 10.1007/bf02122801
If \(C\subset E(G)\) is a maximum cardinality cocircuit of a 2-connected graph G, then no other maximum cocircuit is contained in one and the same block of G-C. The analogous conjecture for real representable matroids would have important applications to classifying convex bodies with a certain Helly type property.
Extremal problems in graph theory, maximum cardinality cocircuit, real representable matroids, Combinatorial aspects of matroids and geometric lattices, Paths and cycles
Extremal problems in graph theory, maximum cardinality cocircuit, real representable matroids, Combinatorial aspects of matroids and geometric lattices, Paths and cycles
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
