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

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

0.00 Avg rating—0 Votes
Article ID: iaor20073055
Country: Netherlands
Volume: 34
Issue: 6
Start Page Number: 639
End Page Number: 646
Publication Date: Nov 2006
Journal: Operations Research Letters
Authors: , ,
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.

Reviews

Required fields are marked *. Your email address will not be published.