๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Vector representable matroids of given r
โœ Lรกszlรณ Babai ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 471 KB

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

Matchings and ฮ”-Matroids with Coefficien
โœ Franz Kalhoff; Walter Wenzel ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 274 KB

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

Graphs with given group and given consta
โœ Walter Vogler ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 228 KB

## 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

Facilitated Ising Model with Soft Restri
โœ M. Schulz; S. Trimper ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 134 KB

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

Construction of Selection Indexes with R
โœ Dr. rer. nat. N. Mielenz ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 455 KB

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