𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Matroids arisen from matrogenic graphs

✍ Scribed by Guoli Ding; Peter L. Hammer

Book ID
104113724
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
444 KB
Volume
165-166
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be a finite simple graph and let 4(G) be the set of subsets X of V(G) such that the subgraph of G induced by X is threshold. If 4(G) is the independence system of a matroid, then G is called matrogenic [3]. In this paper, we characterize matroids arising from matrogenic graphs.

📜 SIMILAR VOLUMES

Excluded-minor characterizations of anti
Excluded-minor characterizations of antimatroids arisen from posets and graph searches
✍ M. Nakamura 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 161 KB

An antimatroid is a family of sets such that it contains an empty set, and it is accessible and closed under union of sets. An antimatroid is an 'antipodal' concept of matroid. We shall show that an antimatroid is derived from shelling of a poset if and only if it does not contain a minor isomorphi

Excluded–Minor Characterizations of Anti
Excluded–Minor Characterizations of Antimatroids arisen from Posets and Graph Searches
✍ M. Nakamura 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 616 KB

An antimatroid is a family of sets such that it contains an empty set, and it is accessible and closed under union of sets. An antimatroid is a 'dual' or 'antipodal' concept of matroill. We shall show that an antimatroid is derived from shelling of a poset if and only if it. docs not contain a mino