We give a new upper bound for the length of the largest induced cycle in the hypercube. ## 1. Introduction Let G1 and Gz be two graphs. The Cartesian product G= G1 x G2 has V(G)= V(G,) x V(G,), and two vertices (ul, u2) and (vl, u2) of G are adjacent if and only if either ul=vl and uzuz~E(G2) or u
โฆ LIBER โฆ
A new upper bound for the length of snakes
โ Scribed by Knut Deimer
- Book ID
- 110564417
- Publisher
- Springer-Verlag
- Year
- 1985
- Tongue
- English
- Weight
- 443 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The snake-in-the-box problem: A new uppe
โ
Hunter S. Snevily
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 453 KB
An upper bound for the period length of
โ
A. Pohl
๐
Article
๐
2007
๐
Vandenhoeck & Ruprecht
๐
German
โ 491 KB
An Upper Bound for the Length of a Finit
โ
Christopher J Pappacena
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 180 KB
Let F be a field, and let A be a finite-dimensional F-algebra. Write d s dim A, F and let e be the largest degree of the minimal polynomial for any a g A. Define ลฝ . ' the function f d, e s e 2dr e y 1 q 1r4 q er2 y 2. We prove that, if S is ลฝ . any finite generating set for A as an F-algebra, the
A new upper bound for Shellsort
โ
Robert Sedgewick
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 796 KB
A new lower bound for Snake-in-the-Box C
โ
J. Wojciechowski
๐
Article
๐
1989
๐
Springer-Verlag
๐
English
โ 386 KB
A new upper bound for the complex Grothe
โ
Uffe Haagerup
๐
Article
๐
1987
๐
The Hebrew University Magnes Press
๐
English
โ 657 KB