✦ LIBER ✦

Symmetric Graphs from Polytopes of High Rank

✍ Scribed by Mark Mixer, Egon Schulte

Book ID: 118783110
Publisher: Springer Japan
Year: 2011
Tongue: English
Weight: 280 KB
Volume: 28
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-011-1089-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polytopes of high rank for the symmetric

Polytopes of high rank for the symmetric groups

✍ Maria Elisa Fernandes; Dimitri Leemans 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Polytopes of high rank for the alternati

Polytopes of high rank for the alternating groups

✍ Maria Elisa Fernandes; Dimitri Leemans; Mark Mixer 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Corrigendum to “Polytopes of high rank f

Corrigendum to “Polytopes of high rank for the symmetric groups” [Adv. Math. 228 (2011) 3207–3222]

✍ Fernandes, Maria Elisa; Leemans, Dimitri; Mixer, Mark 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 123 KB

Stability critical graphs and ranks face

Stability critical graphs and ranks facets of the stable set polytope

✍ E.C. Sewell; L.E. Trotter Jr. 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 616 KB

Rank inequalities due to stability critical (u-critical) graphs are used to develop a finite nested sequence of linear relaxations of the stable set polytope, the strongest of which provides an integral max-min relation: In a simple graph, the maximum size of a stable set is equal to the minimum (we

On non-rank facets of the stable set pol

On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs

✍ Thomas M. Liebling; Gianpaolo Oriolo; Bianca Spille; Gautier Stauffer 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 297 KB

Minimum rank of skew-symmetric matrices

Minimum rank of skew-symmetric matrices described by a graph

✍ IMA-ISU research group on minimum rank 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 337 KB

The minimum (symmetric) rank of a simple graph G over a field F is the smallest possible rank among all symmetric matrices over F whose ijth entry (for i / = j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. The problem of determining minimum (symmetric) rank has been studied exte