Hypergraphes de chaines d'aretes d'un arbre
✍ Scribed by J.-C. Fournier
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 960 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
We introduce the 'edges-paths hypergraph of a tree' and study relations of this notion with graphic geometries, chordable graphs. As particular case, we give a simple characterization of intervals hypergraphs.
📜 SIMILAR VOLUMES
We study the minimal spanning trees of a connected graph G = (X, U) where U is partially preordered (or quasi-ordered). We characterize several kinds of optimal spanning trees and give conditions for existence of strongl3,' optimal tress. Generalizations to ba~s of matro'ids (binary matro'ids in par
Let In] be the set [1,2 ..... n} and fl a permutation of S,, the symmetric group on In]. In this paper we compute the number of m-Husimi's rooted and unrooted trees fixed by conjugation with [~.
Let G be a finite group. The main result of this note shows that the reduced chain complex of an acyclic finite dimensional simplicial G-complex is a split acyclic complex of G-modules. The proof requires the extension of well known results on finitely generated ppermutation modules to arbitrary p-
## Abstract Les spectres de trois allènes ω‐chlorés mettent en évidence deux réarrangements de type McLafferty; l'un s'effectue avec transfert d'hydrogène, I'autre avec transfert de l'atome de chlore.