Distance graphs having large chromatic numbers and not containing cliques or cycles of given size

Details Distance graphs having large chromatic numbers and not containing cliques or cycles of given size Distance graphs having large chromatic numbers and not containing cliques or cycles of given size

2012-02-14

arxiv.org/abs/1202.2968v1

Mathematics

Combinatorics

In Russian

Scientific paper

In this work, the classical Nelson -- Hadwiger problem is studied which lies on the edge of combinatorial geometry and graph theory. It concerns colorings of distance graphs in $ {\mathbb R}^n $, i.e., graphs such that their vertices are vectors and their edges are pairs of vectors at a distance from a given set of postive numbers apart. A series of new lower bounds are obtained for the chromatic numbers of such graphs with different restrictions on the clique numbers and the girths.

Affiliated with

Also associated with

No associations

Rating

Distance graphs having large chromatic numbers and not containing cliques or cycles of given size 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 Distance graphs having large chromatic numbers and not containing cliques or cycles of given size, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance graphs having large chromatic numbers and not containing cliques or cycles of given size will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-88832