✦ LIBER ✦

Minkowsky's conjecture on the critical determinant

✍ Scribed by N. M. Glazunov; A. V. Malyshev

Publisher: Springer US
Year: 1986
Tongue: English
Weight: 637 KB
Volume: 21
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01074709

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A proof of Minkowski's conjecture on the

A proof of Minkowski's conjecture on the critical determinant of the region ¦x¦p+¦y¦p

✍ N. M. Glazunov; A. S. Golovanov; A. V. Malyshev 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 526 KB

Minkowski's conjecture on a system of li

Minkowski's conjecture on a system of linear inhomogeneous forms

✍ Kh. N. Narzullaev 📂 Article 📅 1969 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 263 KB

Mader’s Conjecture On Extremely Critical

Mader’s Conjecture On Extremely Critical Graphs

✍ Matthias Kriesell 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 477 KB

On the critical graph conjecture

✍ Hian Poh Yap 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 222 KB

## Abstract Gol'dberg has recently constructed an infinite family of 3‐critical graphs of even order. We now prove that if there exists a __p__(≥4)‐critical graph __K__ of odd order such that __K__ has a vertex __u__ of valency 2 and another vertex __v__ ≠ __u__ of valency ≤(__p__ + 2)/2, then ther

Proof of Minkowski's conjecture concerni

Proof of Minkowski's conjecture concerning the critical determinant of the region |x|P+ |y|P> 1 for 5 ⩽p ⩽ 6

✍ K. I. Grishmanovskaya; A. V. Malyshev; U. M. Pachev; A. Ch. Fidarova 📂 Article 📅 1981 🏛 Springer US 🌐 English ⚖ 426 KB

Remarks on the critical graph conjecture

✍ I. Broere; C.M. Mynhardt 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 344 KB

The vertex-critical graph conjecture (critical graph conjecture respectively) states that every vertex-critical (critical) graph has an odd number of vertices. In this note we prove that if G is a critical graph of even order, then G has at least three vertices of less-than-maximum valency. In addit