Mathematics – Combinatorics
Scientific paper
2010-02-22
Mathematics
Combinatorics
9 pages
Scientific paper
We show that the vanishing of certain cohomology groups of polyhedral complexes imply upper bounds on Ramsey numbers. Lovasz bounded the chromatic numbers of graphs using Hom complexes. Babson and Kozlov proved Lovasz conjecture and developed a Hom complex theory. We generalize the Hom complexes to Ramsey complexes. The main theorem states that if certain cohomology groups of the Ramsey complex Ram(dDelta_{p^k}, Sigma) are trivial, then the vertices of the simplicial complex Sigma cannot be n-colored such that every color correspond to a face of Sigma. In a corollary, we give an explicit description of the Ramsey complexes used for upper bounds on Ramsey numbers.
No associations
LandOfFree
Cohomological Ramsey Theory 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 Cohomological Ramsey Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cohomological Ramsey Theory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-373336