A simple way of as,;ociating a matroid of prescribed rank with a graph is shown. The matroids so corhstrueted are re.presentable over any sufficiently large field. Their ase is demonstrated by the fallowing result: Given an integer k >~ 3 and a hmction G associating a group with each subsel of a set
Matroids with given restrictions and contractions
โ Scribed by P.J Wilde
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 450 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
which may be characterized by some variant of the Greedy algorithm for solving optimization problems. This paper is devoted to the examination of the particular subclass of โฌ-matroids induced by simple graphs. It is shown that these โฌ-matroids are representable over fields of any characteristic and
## Abstract __A__ graph __L__ is called a link graph if there is a graph __G__ such that for each vertex of __G__ its neighbors induce a subgraph isomorphic to __L.__ Such a G is said to have constant link __.__L Sabidussi proved that for any finite group F and any __n__ โฉพ 3 there are infinitely ma
An analytical approach is proposed to include dynamical constraints into a kinetic Ising model where the spins are subjected to flip processes. The relaxation time shows a non-Arrhenius behaviour. When the constraints are realized with a certain probability the relaxation time decreases further. For
I n this pa.per the problem of uniehge selection with inequality constraint9 is formulated. If the predictor and criterion variables are all normally dietributed, this problem can be written a8 a convex programming problem, with a linear objective function and with linetlr constraint8 and a quedrati