✦ LIBER ✦

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

✍ Scribed by M.S. Escalante; M.S. Montelar; G.L. Nasini

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 201 KB
Volume: 34
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2005.10.008

No coin nor oath required. For personal study only.

✦ Synopsis

We analyze Lipták and Tunçel's conjecture on minimal graphs with N + -rank k. We present necessary conditions for kminimal 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.