𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Intersecting set systems and graphic matroids

✍ Scribed by Attila Sali; Gábor Simonyi

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
340 KB
Volume
185
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Two simple proofs are given to an earlier partial result about an extremal set theoretic conjecture of Chung, Frankl, Graham, Shearer and Faudree, Schelp, S6s, respectively. The statement is slightly strengthened within a matroid theoretic framework. The first proof relies on results from matroid theory, while the second is based on an explicit construction providing an elementary proof.

📜 SIMILAR VOLUMES

On Tutt's Characterization of graphic ma
On Tutt's Characterization of graphic matroids—a graphic proof
✍ A. M. H. Gerards 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB

## Abstract In this paper we present a relatively simple proof of Tutt's characterization of graphic matroids. The proof uses the notion of ‘signed graph’ and it is ‘graphic’ in the sense that it can be presented almost entirely by drawing (signed) graphs. © 1995 John Wiley & Sons, Inc.

Graphic matroids, shellability and the P
Graphic matroids, shellability and the Poincare Conjecture
✍ Andrew Vince 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 610 KB

In this paper we introduce a theory of edge shelling of graphs. Whereas the standard notion of shelling a simplieial complex involves a sequential removal of maximal simplexes, edge shelling involves a sequential removal of the edges of a graph. A necessary and sufficient condition for edge shellabi