𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Implications of forbidden structures for extremal algorithmic problems

✍ Scribed by Ming-Deh A. Huang; Karl J. Lieberherr

Book ID
107948544
Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
884 KB
Volume
40
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Digraph extremal problems, hypergraph ex
Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
✍ W.G Brown; M Simonovits πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 747 KB

We consider extremal problems 'of Tur~ type' for r-uniform ordered hypergraphs, where multiple oriented edges are permitted up to multiplicity q. With any such '(r, q)-graph' G" we associate an r-linear form whose maximum over the standard (n -1)-simplex in R" is called the (graph-) density g(G ") o

Algorithmic Problems for Amalgams of Fin
Algorithmic Problems for Amalgams of Finite Semigroups
✍ Mark V. Sapir πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 118 KB

We prove that there exists an amalgam of two finite 4-nilpotent semigroups such that the corresponding amalgamated product has an undecidable word problem. We also show that the problem of embeddability of finite semigroup amalgams in any semigroups and the problem of embeddability of finite semigro