✦ LIBER ✦

The minimum rank problem: A counterexample

✍ Scribed by Swastik Kopparty; K.P.S. Bhaskara Rao

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 100 KB
Volume: 428
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.10.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum rank problems

✍ Leslie Hogben 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 236 KB

The minimum rank problem over the finite

The minimum rank problem over the finite field of order 2: Minimum rank 3

✍ Wayne Barrett; Jason Grout; Raphael Loewy 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 590 KB

A counterexample to the rank-coloring co

A counterexample to the rank-coloring conjecture

✍ N. Alon; P. D. Seymour 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

It has been conjectured by C. van Nuffelen that the chromatic number of any graph with at least one edge does not exceed the rank of its adjacency matrix. We give a counterexample, with chromatic number 32 and with an adjacency matrix of rank 29.

Lower Bounds in Minimum Rank Problems

✍ Lon H. Mitchell; Sivaram K. Narayan; Andrew M. Zimmer 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 186 KB

The minimum rank of a graph is the smallest possible rank among all real symmetric matrices with the given graph. The minimum semidefinite rank of a graph is the minimum rank among Hermitian positive semidefinite matrices with the given graph. We explore connections between OS-sets and a lower bound

Zero forcing parameters and minimum rank

Zero forcing parameters and minimum rank problems

✍ Francesco Barioli; Wayne Barrett; Shaun M. Fallat; H. Tracy Hall; Leslie Hogben; 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 173 KB

A maximum-rank minimum-term-rank theorem

A maximum-rank minimum-term-rank theorem for matroids

✍ Stephen B. Maurer 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 595 KB