On systems of graphs intersecting in paths
Vojtěch Rödl (1978)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Vojtěch Rödl (1978)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Izak Broere, Johannes Heidema (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The well-known Rado graph R is universal in the set of all countable graphs I, since every countable graph is an induced subgraph of R. We study universality in I and, using R, show the existence of 2 א0 pairwise non-isomorphic graphs which are universal in I and denumerably many other universal graphs in I with prescribed attributes. Then we contrast universality for and universality in induced-hereditary properties of graphs and show that the overwhelming majority of induced-hereditary...
Lawrence Moss (1989)
Fundamenta Mathematicae
Similarity:
L. Szamkołowicz (1962)
Colloquium Mathematicae
Similarity:
Peter Mihók, Jozef Miškuf, Gabriel Semanišin (2009)
Discussiones Mathematicae Graph Theory
Similarity:
A graph property is any isomorphism closed class of simple graphs. For a simple finite graph H, let → H denote the class of all simple countable graphs that admit homomorphisms to H, such classes of graphs are called hom-properties. Given a graph property 𝓟, a graph G ∈ 𝓟 is universal in 𝓟 if each member of 𝓟 is isomorphic to an induced subgraph of G. In particular, we consider universal graphs in → H and we give a new proof of the existence of a universal graph in → H, for any finite...
Svatopluk Poljak, Vojtěch Rödl (1983)
Czechoslovak Mathematical Journal
Similarity:
Farrell, E.J. (1992)
International Journal of Mathematics and Mathematical Sciences
Similarity: