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

In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton

โœ Scribed by A. A. Klyachko; I. K. Rystsov; M. A. Spivak

Publisher
Springer US
Year
1987
Tongue
English
Weight
783 KB
Volume
23
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Efficient Preconditioned CG Method fo
An Efficient Preconditioned CG Method for the Solution of a Class of Layered Problems with Extreme Contrasts in the Coefficients
โœ C Vuik; A Segal; J.A Meijerink ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 165 KB

Knowledge of fluid pressure is important to predict the presence of oil and gas in reservoirs. A mathematical model for the prediction of fluid pressures is given by a time-dependent diffusion equation. Application of the finite element method leads to a system of linear equations. A complication is

Tight upper bound on the number of edges
Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application
โœ Zhi-Zhong Chen; Shiqing Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 68 KB

We show that an n-vertex bipartite K 3,3 -free graph with n 3 has at most 2n -4 edges and that an n-vertex bipartite K 5 -free graph with n 5 has at most 3n -9 edges. These bounds are also tight. We then use the bound on the number of edges in a K 3,3 -free graph to extend two known NC algorithms fo