Geodesic
Toward a graph version of Rado's theorem
Andy Parrish1
1University of California, San Diego
The electronic journal of combinatorics, Tome 20 (2013) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

An equation is called graph-regular if it always has monochromatic solutions under edge-colorings of $K_{\mathbb{N}}$. We present two Rado-like conditions which are respectively necessary and sufficient for an equation to be graph-regular.
DOI : 10.37236/3082
Classification : 05C15, 05C55
Mots-clés : coloring, Ramsey theory, Rado's theorem

Andy Parrish  1

1 University of California, San Diego 
@article{10_37236_3082,
     author = {Andy Parrish},
     title = {Toward a graph version of {Rado's} theorem},
     journal = {The electronic journal of combinatorics},
     year = {2013},
     volume = {20},
     number = {1},
     doi = {10.37236/3082},
     zbl = {1267.05123},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/3082/}
}
TY  - JOUR
AU  - Andy Parrish
TI  - Toward a graph version of Rado's theorem
JO  - The electronic journal of combinatorics
PY  - 2013
VL  - 20
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/3082/
DO  - 10.37236/3082
ID  - 10_37236_3082
ER  - 
%0 Journal Article
%A Andy Parrish
%T Toward a graph version of Rado's theorem
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/3082/
%R 10.37236/3082
%F 10_37236_3082
Andy Parrish. Toward a graph version of Rado's theorem. The electronic journal of combinatorics, Tome 20 (2013) no. 1. doi: 10.37236/3082

Cité par Sources :