Independent sets in almost-regular graphs and the Cameron-Erdos problem for non-invariant linear equations

Details Independent sets in almost-regular graphs and the Cameron-Erdos problem for non-invariant linear equations Independent sets in almost-regular graphs and the Cameron-Erdos problem for non-invariant linear equations

2009-05-07

arxiv.org/abs/0905.0990v2

Mathematics

Number Theory

This paper is withdrawn as I have learned that the main result (Theorem 2.2) follows from a previously known result, namely Th

Scientific paper

We propose a generalisation of the Cameron-Erdos conjecture for sum-free sets
to arbitrary non-translation invariant linear equations over Z in three or more
variables and, using well-known methods from graph theory, prove a weak form of
the conjecture for a class of equations where the structure of the maximum-size
sets avoiding solutions to the equation has been previously obtained.

Affiliated with

Also associated with

No associations

Rating

Independent sets in almost-regular graphs and the Cameron-Erdos problem for non-invariant linear equations 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 Independent sets in almost-regular graphs and the Cameron-Erdos problem for non-invariant linear equations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Independent sets in almost-regular graphs and the Cameron-Erdos problem for non-invariant linear equations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-455527