𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An upper bound on the size of the snake-in-the-box

✍ Scribed by Gilles Zémor

Publisher
Springer-Verlag
Year
1997
Tongue
English
Weight
455 KB
Volume
17
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
The snake-in-the-box problem: A new upper bound
✍ Hunter S. Snevily 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 453 KB

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

An upper bound on the size of the larges
An upper bound on the size of the largest cliques in a graph
✍ Alain Billionnet 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB 👁 1 views

## Abstract We produce in this paper an upper bound for the number of vertices existing in a clique of maximum cardinal. The proof is based in particular on the existence of a maximum cardinal clique that contains no vertex __x__ such that the neighborhood of __x__ is contained in the neighborhood

An upper bound on the size of a largest
An upper bound on the size of a largest clique in a graph
✍ Dennis P. Geoffroy; David P. Sumner 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB 👁 1 views

## Abstract A graph is point determining if distinct vertices have distinct neighborhoods. The nucleus of a point‐determining graph is the set __G__^O^ of all vertices, __v__, such that __G__–__v__ is point determining. In this paper we show that the size, ω(__G__), of a maximum clique in __G__ sat