✦ LIBER ✦

A characterization of network representable polymatroids

✍ Scribed by W. W. Bein; P. Brucker; M. F. M. Stallmann

Book ID: 105188137
Publisher: Springer
Year: 1991
Tongue: English
Weight: 313 KB
Volume: 35
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01417514

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Characterization of Tutte Invariants o

A Characterization of Tutte Invariants of 2-Polymatroids

✍ J. Oxley; G. Whittle 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 985 KB

A characterization of uniquely represent

A characterization of uniquely representable interval graphs

✍ Peter C. Fishburn 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 200 KB

A single-point characterization of repre

A single-point characterization of representable uninorms

✍ János Fodor; Bernard De Baets 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 208 KB

Polymatroidal Flows on Two Classes of In

Polymatroidal Flows on Two Classes of Information Networks

✍ Vasudevan, D.; Korada, S.B. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 186 KB

A characterization of set representable

A characterization of set representable labeled partial 2-structures through decompositions

✍ A. Ehrenfeucht; G. Rozenberg 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 398 KB

A simple construction of representable r

A simple construction of representable relation algebras with non-representable completions

✍ Tarek Sayed Ahmed 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract We give a simple new construction of representable relation algebras with non‐representable completions. Using variations on our construction, we show that the elementary closure of the class of completely representable relation algebras is not finitely axiomatizable (© 2009 WILEY‐VCH V