Minimal N+-rank graphs: Progress on Lipták and Tunçel's conjecture

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.