On Binary Reducibility
Copyright policy )On Binary Reducibility
Lovász and the reviewer proved that a connected graphic matroid M is the sum of two matroids of rank at least one if and only if M-e is disconnected for at least one element e. Cunningham generalized this for binary maroids. The present author gives a shorter proof for the general result, using geometric ideas of Mason and a theorem of Lucas on rank preserving weak maps.
- University of Queensland Australia
- University of Queensland Australia
geometric ideas, Combinatorial aspects of matroids and geometric lattices, Theoretical Computer Science, Computational Theory and Mathematics, 2607 Discrete Mathematics and Combinatorics, Discrete Mathematics and Combinatorics, rank preserving weak maps, Geometry and Topology, general result, binary maroids, connected graphic matroid, sum of two matroids
geometric ideas, Combinatorial aspects of matroids and geometric lattices, Theoretical Computer Science, Computational Theory and Mathematics, 2607 Discrete Mathematics and Combinatorics, Discrete Mathematics and Combinatorics, rank preserving weak maps, Geometry and Topology, general result, binary maroids, connected graphic matroid, sum of two matroids
citations 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
Citations provided by BIP!Popularity provided by BIP!