𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Directed Graphs and Combinatorial Properties of Semigroups

✍ Scribed by A.V. Kelarev; S.J. Quinn

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
104 KB
Volume
251
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hereditary properties of combinatorial s
Hereditary properties of combinatorial structures: Posets and oriented graphs
✍ JΓ³zsef Balogh; BΓ©la BollobΓ‘s; Robert Morris πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 247 KB πŸ‘ 1 views

## Abstract A hereditary property of combinatorial structures is a collection of structures (e.g., graphs, posets) which is closed under isomorphism, closed under taking induced substructures (e.g., induced subgraphs), and contains arbitrarily large structures. Given a property $\cal {P}$, we write

Realization of Matrices and Directed Gra
Realization of Matrices and Directed Graphs
✍ Rajeev Motwani πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 182 KB

We consider the problem of constructing a matrix with prescribed row and Γ„ 4 column sums, subject to the condition that the off-diagonal entries are in 0, 1 and the diagonal entries are nonnegative integers. The pair of row and column sum vectors is called realizable if such a matrix exists. This is

RNA Structures with Pseudo-knots: Graph-
RNA Structures with Pseudo-knots: Graph-theoretical, Combinatorial, and Statistical Properties
✍ C Haslinger; P.F Stadler πŸ“‚ Article πŸ“… 1999 πŸ› Springer 🌐 English βš– 461 KB

The secondary structures of nucleic acids form a particularly important class of contact structures. Many important RNA molecules, however, contain pseudo-knots, a structural feature that is excluded explicitly from the conventional definition of secondary structures. We propose here a generalizatio

Generalized Pigeonhole Properties of Gra
Generalized Pigeonhole Properties of Graphs and Oriented Graphs
✍ Anthony Bonato; Peter J Cameron; Dejan DeliΔ‡; StΓ©phan ThomassΓ© πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 152 KB

A relational structure A satisfies the P(n, k) property if whenever the vertex set of A is partitioned into n nonempty parts, the substructure induced by the union of some k of the parts is isomorphic to A. The P(2, 1) property is just the pigeonhole property, (P), introduced by Cameron, and studied