𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lower bound for the crossing number of Cm × Cn

✍ Scribed by Gelasio Salazar

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
67 KB
Volume
35
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the independence number
A lower bound on the independence number of arbitrary hypergraphs
✍ Thiele, Torsten 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB 👁 2 views

We present a lower bound on the independence number of arbitrary hypergraphs in terms of the degree vectors. The degree vector of a vertex v is given by d is the number of edges of size m containing v. We define a function f with the property that any hypergraph H = (V, E) satisfies α(H) ≥ v∈V f (d

A nonlinear programming approach to lowe
A nonlinear programming approach to lower bounds for the ground-state energy of helium
✍ I. Porras; D. Matthew Feldmann; Frederick W. King 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB 👁 1 views

Lower-bound estimates for the ground-state energy of the helium atom are determined using nonlinear programming techniques. Optimized lower bounds are determined for single-particle, radially correlated, and general correlated wave functions. The local nature of the method employed makes it a very s

Some new bounds for the maximum number o
Some new bounds for the maximum number of vertex colorings of a (v,e)-graph
✍ Byer, Owen D. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 2 views

Let f (v, e, λ) denote the maximum number of proper vertex colorings of a graph with v vertices and e edges in λ colors. In this paper we present some new upper bounds for f (v, e, λ). In particular, a new notion of pseudoproper colorings of a graph is given, which allows us to significantly improve