There is no universal countable random-free graph
نویسنده
چکیده
We consider embeddings between infinite graphs. In particular, We establish that there is no universal element in the class of countable graphs into which the random graph is not embeddable.
منابع مشابه
Uncountable graphs and invariant measures on the set of universal countable graphs
We give new examples and describe the complete lists of all measures on the set of countable homogeneous universal graphs and Ksfree homogeneous universal graphs (for s ≥ 3) that are invariant with respect to the group of all permutations of the vertices. Such measures can be regarded as random graphs (respectively, random Ks-free graphs). The well-known example of Erdös–Rényi (ER) of the rando...
متن کاملThere is no universal countable pentagon-free graph
No countable C,-free graph contains every countable C,-free graph as a subgraph, for n 2 4. For n = 4, this was proved earlier by J. Pach.
متن کاملUniversal graphs with a forbidden subtree
The systematic investigation of countable universal graphs with “forbidden” subgraphs was initiated in [13], followed by [12]. If C is a finite connected graph, then a graph G is C-free if it contains no subgraph isomorphic to C. A countable C-free graph G is weakly universal if every countable C-free graph is isomorphic to a subgraph of G, and strongly universal if every such graph is isomorph...
متن کاملA Universal Structure for Jv-free Graphs
Countable homogeneous graphs have been classified by Alistair Lachlan and Robert Woodrow [5,11]. There is a countable bipartite graph called the universal 'homogeneous' bipartite graph. However, this graph does not occur in Lachlan and Woodrow's list, because it is not homogeneous as a graph but only as a graph with a fixed bipartition (Cameron [1]). In this paper, I describe a graph which is a...
متن کاملUniversal Graphs without Large Cliques
The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 282 شماره
صفحات -
تاریخ انتشار 2004