Toward a graph version of Rado's theorem

Details Toward a graph version of Rado's theorem Toward a graph version of Rado's theorem

2012-02-12

arxiv.org/abs/1202.2581v1

Mathematics

Combinatorics

Scientific paper

An equation is called graph-regular if it always has monochromatic solutions
under edge-colorings of the complete graph on the naturals. We present two
Rado-like conditions which are respectively necessary and sufficient for an
equation to be graph-regular.

Affiliated with

Also associated with

No associations

Rating

Toward a graph version of Rado's theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Toward a graph version of Rado's theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Toward a graph version of Rado's theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-680462