Article ID Journal Published Year Pages File Type
1143267 Operations Research Letters 2006 8 Pages PDF
Abstract
We analyze Lipták and Tunçel's conjecture on minimal graphs with N+-rank k. We present necessary conditions for k-minimal graphs and describe the family of 2-minimal graphs. We find a 3-minimal graph and show that there is no k-minimal subdivision of complete graph for k>4.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Minimal N+-rank graphs: Progress on Lipták and Tunçel's conjecture
Authors
, , ,