Add to ORKGAbstract. We prove that it is consistent that ℵω is strong limit, 2ℵω is large and the universality number for graphs on ℵω+1 is small. The proof uses Prikry forcing with interleaved collapsing. 1
AbstractGiven integers r and s, and n large compared to r and s, we determine the maximum size of a ...
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...
<p>We prove that it is consistent that ℵ<sub>ω</sub> is strong limit, 2<sup>ℵ<sub>ω</sub></sup> is l...
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...
Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szeg...
For any positive ¦ integers § and, ¨� © ¦ � §� � let denote the family of graphs § on vertices wit...
Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szeg...
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 is said to be ℋ(n, Δ)-universal if it contains every graph on n vertices with maximum degr...
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...
AbstractLet an integer s ⩾ 1 and a graph G be given. Let us denote by χs(G) the smallest integer χ f...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
AbstractGiven integers r and s, and n large compared to r and s, we determine the maximum size of a ...
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...
<p>We prove that it is consistent that ℵ<sub>ω</sub> is strong limit, 2<sup>ℵ<sub>ω</sub></sup> is l...
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...
Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szeg...
For any positive ¦ integers § and, ¨� © ¦ � §� � let denote the family of graphs § on vertices wit...
Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szeg...
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 is said to be ℋ(n, Δ)-universal if it contains every graph on n vertices with maximum degr...
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...
AbstractLet an integer s ⩾ 1 and a graph G be given. Let us denote by χs(G) the smallest integer χ f...
A graph G has a strong parity factor F if for every subset X ⊆ V (G) with |X| even, G contains a spa...
AbstractGiven integers r and s, and n large compared to r and s, we determine the maximum size of a ...
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...