𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dirac’s Theorem on Simplicial Matroids

✍ Scribed by Raul Cordovil; Manoel Lemos; Cláudia Linhares Sales

Publisher
Springer
Year
2009
Tongue
English
Weight
225 KB
Volume
13
Category
Article
ISSN
0218-0006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note on binary simplicial matroids
Note on binary simplicial matroids
✍ Jiří Tůma 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Using an earlier characterization of simplicial hypergraphs we obtain a characterization of binary simplicial matroids in terms of the existence of a special base.

Separability generalizes Dirac's theorem
Separability generalizes Dirac's theorem
✍ Anne Berry; Jean-Paul Bordat 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 736 KB

In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to strengthen Dirac's theorem : "Every non-clique triangulated graph has at least two non-adjacent simplicial vertices", res

A homotopy theorem on oriented matroids
A homotopy theorem on oriented matroids
✍ R. Cordovil; M.L. Moreira 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 348 KB

Consider a finite family of hyperplanes \_%? = {Hi, . \_. , H,} in the finite-dimensional vector space IWd. We call chambers (determined by 2) the connected components of W"\ U y=, Hi. Galleries are finite families of chambers (C,,,C,, , C,), where exactly one hyperplane separates Ci+i from Ci, for

Dirac's map-color theorem for choosabili
Dirac's map-color theorem for choosability
✍ B�hme, T.; Mohar, B.; Stiebitz, M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB

It is proved that the choice number of every graph G embedded on a surface of Euler genus ε ≥ 1 and ε = 3 is at most the Heawood number H(ε) = (7 + √ 24ε + 1)/2 and that the equality holds if and only if G contains the complete graph K H(ε) as a subgraph.