AbstractThe question of whether or not a given countable arithmetically saturated model of Peano Arithmetic has a generic automorphism is shown to be very closely connected to Hedetniemi's well-known conjecture on the chromatic number of products of graphs
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
AbstractThe pseudoachromatic number of a graph is the largest number of colours in a (not necessaril...
AbstractThe question of whether or not a given countable arithmetically saturated model of Peano Ari...
When studying the automorphism group Aut(M) of a model M, one is interested to what extent M is rec...
When studying the automorphism group Aut(M) of a model M, one is interested to what extent M is rec...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
AbstractWe develop the method of iterated ultrapower representation to provide a unified and perspic...
In this note, a direct proof is given of the NP-completeness of a variant of GRAPH COLORING, i.e., ...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
In this note, a direct proof is given of the NP-completeness of a variant of GRAPH COLORING, i.e., a...
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
AbstractThe pseudoachromatic number of a graph is the largest number of colours in a (not necessaril...
AbstractThe question of whether or not a given countable arithmetically saturated model of Peano Ari...
When studying the automorphism group Aut(M) of a model M, one is interested to what extent M is rec...
When studying the automorphism group Aut(M) of a model M, one is interested to what extent M is rec...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
AbstractWe develop the method of iterated ultrapower representation to provide a unified and perspic...
In this note, a direct proof is given of the NP-completeness of a variant of GRAPH COLORING, i.e., ...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
In this note, a direct proof is given of the NP-completeness of a variant of GRAPH COLORING, i.e., a...
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
The pseudoachromatic number of a graph is the largest number of colours in a (not necessarily proper...
AbstractThe pseudoachromatic number of a graph is the largest number of colours in a (not necessaril...
DOI
Add to ORKG