𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On universal graphs without instances of CH

✍ Scribed by Saharon Shelah

Book ID
103600750
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
801 KB
Volume
26
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the existence of countable universal
On the existence of countable universal graphs
✍ FοΏ½redi, ZoltοΏ½n; KomjοΏ½th, PοΏ½ter πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 92 KB πŸ‘ 2 views

Let Forb(G) denote the class of graphs with countable vertex sets which do not contain G as a subgraph. If G is finite, 2-connected, but not complete, then Forb(G) has no element which contains every other element of Forb(G) as a subgraph, i.e., this class contains no universal graph.

On universal graphs for planar oriented
On universal graphs for planar oriented graphs of a given girth
✍ O.V. Borodin; A.V. Kostochka; J. NeΕ‘etΕ™il; A. Raspaud; E. Sopena πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 662 KB

The oriented chromatic number o(H) of an oriented graph H is defined to be the minimum order of an oriented graph H' such that H has a homomorphism to H'. If each graph in a class ~ has a homomorphism to the same H', then H' is ~-universal. Let ~k denote the class of orientations of planar graphs wi