✦ LIBER ✦

Number of bound states and estimates on some geometric invariants

✍ Scribed by P Bérard; G Besson

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 1018 KB
Volume: 94
Category: Article
ISSN: 0022-1236
DOI: 10.1016/0022-1236(90)90019-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Estimate on the Number of Bound State

An Estimate on the Number of Bound States of Schrödinger Operators

✍ Kunihiko Sugimura 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 140 KB

Some upper bounds on the total and list

Some upper bounds on the total and list chromatic numbers of multigraphs

✍ Roland Häggkvist; Amanda Chetwynd 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 762 KB

## Abstract In this paper we discuss some estimates for upper bounds on a number of chromatic parameters of a multigraph. In particular, we show that the total chromatic number for an __n__‐order multigraph exceeds the chromatic index by the smallest __t__ such that __t__! > __n__.

On some simple degree conditions that gu

On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs

✍ Vu, Van H. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB 👁 2 views

It is well known that almost every graph in the random space G(n, p) has chromatic number of order O(np/ log(np)), but it is not clear how we can recognize such graphs without eventually computing the chromatic numbers, which is NP-hard. The first goal of this article is to show that the above-menti