𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the existence of countable universal graphs

✍ Scribed by F�redi, Zolt�n; Komj�th, P�ter

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
92 KB
Volume
25
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On the existence of Mikhailov
On the existence of Mikhailov
✍ Koenig, Michael E.D. 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 1 views

This conclusion is not universally accepted. Forsyth for example, argues that the writings of numerous Jesuit missionaries in Brazil in the sixteenth century makes a very strong case for cannibalism among the indigenous Tupi speaking Indians (Forsyth, 1983). Most anthropologists would agree, however

On the linear arboricity of planar graph
On the linear arboricity of planar graphs
✍ Wu, Jian-Liang 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. Akiyama, Exoo, and Harary conjectured for any simple graph G with maximum degree ∆. The conjecture has been proved to be true for graphs having ∆ =

Various results on the toughness of grap
Various results on the toughness of graphs
✍ Broersma, Hajo; Engbers, Erik; Trommel, Huib 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB 👁 2 views

Let G be a graph and let t Ն 0 be a real number. Then, We discuss how the toughness of (spanning) subgraphs of G and related graphs depends on (G), we give some sufficient degree conditions implying that (G) Ն t, and we study which subdivisions of 2-connected graphs have minimally 2-tough squares.

On the chromatic number of disk graphs
On the chromatic number of disk graphs
✍ Malesi?ska, Ewa; Piskorz, Steffen; Wei�enfels, Gerhard 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB 👁 2 views

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their

On the existence of triplewhist tourname
On the existence of triplewhist tournaments TWh(v)
✍ Y. Lu; L. Zhu 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views

It is well known that a triplewhist tournament TWh(v) exists only if v ≡ 0 or 1 (mod 4) and v = 5, 9. In this article, we introduce a new concept TWh-frame and use it to show that the necessary condition for the existence of a TWh(v) is also sufficient with a handful possible exceptions of v ∈ {12,

On the asymptotic existence of complex H
On the asymptotic existence of complex Hadamard matrices
✍ R. Craigen; W. H. Holzmann; H. Kharaghani 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB 👁 1 views

Let N = N (q) be the number of nonzero digits in the binary expansion of the odd integer q. A construction method is presented which produces, among other results, a block circulant complex Hadamard matrix of order 2 α q, where α ≥ 2N -1. This improves a recent result of Craigen regarding the asympt