𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A bound for the collinearity graph of certain locally polar geometries

✍ Scribed by Antonio Pasini

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
202 KB
Volume
58
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A bound for the complexity of a simple g
A bound for the complexity of a simple graph
✍ Robert Grone; Russell Merris πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 310 KB

Let G be a simple (nonfat graph wiih degree sequeme dl, dz, l . . , d,. The ~~~~~ of spanning trees of G is bounded above by

A lower bound for the circumference of a
A lower bound for the circumference of a graph
✍ Nathan Linial πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 423 KB

Lrzt G = (V, 0 be a ttlock :.>f order n, different from Kn. Let ~FI = min {d(x) + d(y): n then G contains a cycle of length at least m. 1. Introductlion and notatio e discuss only finite undirected graphs withsLc loops and multiple edges. We p:rosye the main theorem d show how Qre's th -orem [ 3.1 o

An upper bound for the path number of a
An upper bound for the path number of a graph
✍ Alan Donald πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ LovΓ‘sz has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≀ 1/2 __u__ + __g__ ‐ 1 ≀ __n__ ‐ 1, where __n__ is the total numbe