✦ LIBER ✦

Extending polar spaces of rank at least 3

✍ Scribed by Dmitrii V Pasechnik

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 557 KB
Volume: 72
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(95)90062-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pseudopolar spaces of polar rank three

✍ G. Hanssens; J. A. Thas 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 898 KB

Uniform Hyperplanes of Finite Dual Polar

Uniform Hyperplanes of Finite Dual Polar Spaces of Rank 3

✍ A. Pasini; S. Shpectorov 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Let 2 be a finite thick dual polar space of rank 3. We say that a hyperplane H of 2 is locally singular (respectively, quadrangular or ovoidal) if H & Q is the perp of a point (resp. a subquadrangle or an ovoid) of Q for every quad Q of 2. If H is locally singular, quadrangular, or ovoidal, then we

Order 24 Hadamard matrices of character

Order 24 Hadamard matrices of character at least 3

✍ Judith Q Longyear 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 863 KB

Generating quadrangulations of surfaces

Generating quadrangulations of surfaces with minimum degree at least 3

✍ Nakamoto, Atsuhiro 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB

In this article, we show that all quadrangulations of the sphere with minimum degree at least 3 can be constructed from the pseudo-double wheels, preserving the minimum degree at least 3, by a sequence of two kinds of transformations called "vertex-splitting" and "4-cycle addition." We also consider

Every circle graph of girth at least 5 i

Every circle graph of girth at least 5 is 3-colourable

✍ A.A. Ageev 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 235 KB

It is known that every triangle-free (equivalently, of girth at least 4) circle graph is 5-colourable and that there exist examples of these graphs which are not 4-colourable . In this note we show that every circle graph of girth at least 5 is 2-degenerate and, consequently, not only 3-colourable

On minors of graphs with at least 3n −4

On minors of graphs with at least 3n −4 edges

✍ M. Khalifat; Themistocles Politof; A. Satyanarayana 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 390 KB 👁 1 views

## Abstract A point disconnecting set __S__ of a graph __G__ is a nontrivial __m__‐separator, where __m__ = |__S__|, if the connected components of __G__ ‐ __S__ can be partitioned into two subgraphs, each of which has at least two points. A 3‐connected graph is quasi 4‐connected if it has no nontr