𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Martin's axiom and ordinal graphs: large

✍ Scribed by Jean A. Larson

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
640 KB
Volume
47
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On large (Ξ”, 6)-Graphs
On large (Ξ”, 6)-Graphs
✍ J. GΓ³mez MartΓ­ πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 100 KB

In this article, a new method is proposed for obtaining large-diameter 6 graphs by replacing some vertices of a Moore bipartite diameter 6 graph by complete K h graphs. These complete graphs are joined to the remaining nonmodified graph and to each other by means of new edges. More precisely, these

Decomposing large graphs with small grap
Decomposing large graphs with small graphs of high density
✍ Yuster, Raphael πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 146 KB πŸ‘ 2 views

It is shown that for every positive integer h, and for every > 0, there are graphs H = (V H , E H ) with at least h vertices and with density at least 0.5with the following property: any graph with minimum degree at least |V G | 2 (1 + o(1)) and |E H | divides |E G |, then G has an H-decomposition.