<p>We prove that it is consistent that ℵ<sub>ω</sub> is strong limit, 2<sup>ℵ<sub>ω</sub></sup> is large and the universality number for graphs on ℵ<sub>ω+1</sub> is small. The proof uses Prikry forcing with interleaved collapsing</p
For any positive ¦ integers § and, ¨� © ¦ � §� � let denote the family of graphs § on vertices wit...
If a class G of countable graphs has a member G* that contains a copy of every G ∈ G then G* is call...
A class of graphs $\mathcal{C}$ ordered by the homomorphism relation is universal if every countable...
Abstract. We prove that it is consistent that ℵω is strong limit, 2ℵω is large and the universality ...
AbstractWe first prove the consistency of: there is a universal graph of power ℵ1<2ℵ0 = 2ℵ1=ℵ2. The ...
If a class G of countable graphs has a member G* that contains a copy of every G ∈ G then G* is call...
A graph U is an induced universal graph for a family F of graphs if every graph in F is a vertex-ind...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as a...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
AbstractAmong a family of graphs H a graph G is called universal if any graph in H is isomorphic to ...
Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szeg...
Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szeg...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
A graph G is said to be ℋ(n, Δ)-universal if it contains every graph on n vertices with maximum degr...
For any positive ¦ integers § and, ¨� © ¦ � §� � let denote the family of graphs § on vertices wit...
If a class G of countable graphs has a member G* that contains a copy of every G ∈ G then G* is call...
A class of graphs $\mathcal{C}$ ordered by the homomorphism relation is universal if every countable...
Abstract. We prove that it is consistent that ℵω is strong limit, 2ℵω is large and the universality ...
AbstractWe first prove the consistency of: there is a universal graph of power ℵ1<2ℵ0 = 2ℵ1=ℵ2. The ...
If a class G of countable graphs has a member G* that contains a copy of every G ∈ G then G* is call...
A graph U is an induced universal graph for a family F of graphs if every graph in F is a vertex-ind...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as a...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
AbstractAmong a family of graphs H a graph G is called universal if any graph in H is isomorphic to ...
Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szeg...
Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szeg...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
A graph G is said to be ℋ(n, Δ)-universal if it contains every graph on n vertices with maximum degr...
For any positive ¦ integers § and, ¨� © ¦ � §� � let denote the family of graphs § on vertices wit...
If a class G of countable graphs has a member G* that contains a copy of every G ∈ G then G* is call...
A class of graphs $\mathcal{C}$ ordered by the homomorphism relation is universal if every countable...
DOI
Add to ORKG