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 the existence of Mikhailov
β Scribed by Koenig, Michael E.D.
- Publisher
- John Wiley and Sons
- Year
- 1993
- Tongue
- English
- Weight
- 220 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0002-8231
No coin nor oath required. For personal study only.
β¦ Synopsis
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, that Arens
π SIMILAR VOLUMES
From the notion of equivalence relation and classes induced by them, the sets of points related by reversible processes restricted suitably are shown to be disjoint. By definition, each of thr above sets is arcwise-connected and 80 connected by HAUSDOREF'S theorem. Adiabatic processes are defined to
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,
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