𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On linguistic dynamical systems, families of graphs of large girth, and cryptography

✍ Scribed by V. A. Ustimenko

Book ID
106434841
Publisher
Springer US
Year
2007
Tongue
English
Weight
234 KB
Volume
140
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the bipartite density of regular grap
On the bipartite density of regular graphs with large girth
✍ OndΕ™ej ZΓ½ka πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 1 views

## Abstract Let __B(G)__ be the edge set of a bipartite subgraph of a graph __G__ with the maximum number of edges. Let __b~k~__ = inf{|__B(G)__|/|__E(G)__β€–__G__ is a cubic graph with girth at least __k__}. We will prove that lim~k β†’ ∞~ __b~k~__ β‰₯ 6/7.

[Studies in Computational Intelligence]
[Studies in Computational Intelligence] Artificial Intelligence, Evolutionary Computing and Metaheuristics Volume 427 || On Dynamical Systems of Large Girth or Cycle Indicator and Their Applications to Multivariate Cryptography
✍ Yang, Xin-She πŸ“‚ Article πŸ“… 2013 πŸ› Springer Berlin Heidelberg 🌐 English βš– 334 KB

Alan Turing pioneered many research areas such as artificial intelligence, computability, heuristics and pattern formation.Β  Nowadays at the information age, it is hard to imagine how the world would be without computers and the Internet. Without Turing's work, especially the core concept of Turing

On Dense Bipartite Graphs of Girth Eight
On Dense Bipartite Graphs of Girth Eight and Upper Bounds for Certain Configurations in Planar Point–Line Systems
✍ D de Caen; L.A SzΓ©kely πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 956 KB

In earlier work we showed that if G(m, n) is a bipartite graph with no 4-cycles or 6-cycles, and if m<c 1 n 2 and n<c 2 m 2 , then the number of edges e is O((mn) 2Γ‚3 ). Here we give a more streamlined proof, obtaining some sharp results; for example, if G has minimum degree at least two then e 3 -