AbstractWe first prove the consistency of: there is a universal graph of power ℵ1<2ℵ0 = 2ℵ1=ℵ2. The consistency of the non-existence of a universal graph of power ℵ1 is trivial. Add ℵ2 Cohen generic reals. We then show that we can have 2ℵ0=ℵ2<2ℵ1, and get similar results for other cardinals
If a class G of countable graphs has a member G* that contains a copy of every G ∈ G then G* is call...
AbstractFor any permutation π of the vertex set of a graph G, the generalized prism πG is obtained b...
AbstractKojman, M. and S. Shelah, The universality spectrum of stable unsuperstable theories, Annals...
AbstractAmong a family of graphs H a graph G is called universal if any graph in H is isomorphic to ...
Abstract. We prove that it is consistent that ℵω is strong limit, 2ℵω is large and the universality ...
<p>We prove that it is consistent that ℵ<sub>ω</sub> is strong limit, 2<sup>ℵ<sub>ω</sub></sup> is l...
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as a...
A universal labeling of a graph G is a labeling of the edge set in G such that in every orientation ...
A graph property is any isomorphism closed class of simple graphs. For a simple finite graph H, let ...
AbstractFor every pair of finite connected graphs F and H, and every positive integer k, we construc...
summary:Given two disjoint copies of a graph $G$, denoted $G^1$ and $G^2$, and a permutation $\pi $ ...
summary:Given two disjoint copies of a graph $G$, denoted $G^1$ and $G^2$, and a permutation $\pi $ ...
In the following κ and λ are arbitrary regular uncountable cardinals. What was known? Theorem 1 (Bal...
The systematic investigation of countable universal graphs with “forbidden” subgraphs was initiated ...
A graph property is a class of graphs which is closed under isomorphisms. Some properties are also c...
If a class G of countable graphs has a member G* that contains a copy of every G ∈ G then G* is call...
AbstractFor any permutation π of the vertex set of a graph G, the generalized prism πG is obtained b...
AbstractKojman, M. and S. Shelah, The universality spectrum of stable unsuperstable theories, Annals...
AbstractAmong a family of graphs H a graph G is called universal if any graph in H is isomorphic to ...
Abstract. We prove that it is consistent that ℵω is strong limit, 2ℵω is large and the universality ...
<p>We prove that it is consistent that ℵ<sub>ω</sub> is strong limit, 2<sup>ℵ<sub>ω</sub></sup> is l...
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as a...
A universal labeling of a graph G is a labeling of the edge set in G such that in every orientation ...
A graph property is any isomorphism closed class of simple graphs. For a simple finite graph H, let ...
AbstractFor every pair of finite connected graphs F and H, and every positive integer k, we construc...
summary:Given two disjoint copies of a graph $G$, denoted $G^1$ and $G^2$, and a permutation $\pi $ ...
summary:Given two disjoint copies of a graph $G$, denoted $G^1$ and $G^2$, and a permutation $\pi $ ...
In the following κ and λ are arbitrary regular uncountable cardinals. What was known? Theorem 1 (Bal...
The systematic investigation of countable universal graphs with “forbidden” subgraphs was initiated ...
A graph property is a class of graphs which is closed under isomorphisms. Some properties are also c...
If a class G of countable graphs has a member G* that contains a copy of every G ∈ G then G* is call...
AbstractFor any permutation π of the vertex set of a graph G, the generalized prism πG is obtained b...
AbstractKojman, M. and S. Shelah, The universality spectrum of stable unsuperstable theories, Annals...
DOI
Add to ORKG