Non-three-colorable common graphs exist

Details Non-three-colorable common graphs exist Non-three-colorable common graphs exist

2011-05-02

arxiv.org/abs/1105.0307v1

Mathematics

Combinatorics

9 pages

Scientific paper

A graph H is called common if the total number of copies of H in every graph and its complement asymptotically minimizes for random graphs. A former conjecture of Burr and Rosta, extending a conjecture of Erdos asserted that every graph is common. Thomason disproved both conjectures by showing that the complete graph of order four is not common. It is now known that in fact the common graphs are very rare. Answering a question of Sidorenko and of Jagger, Stovicek and Thomason from 1996 we show that the 5-wheel is common. This provides the first example of a common graph that is not three-colorable.

Affiliated with

Also associated with

No associations

Rating

Non-three-colorable common graphs exist 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 Non-three-colorable common graphs exist, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-three-colorable common graphs exist will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-426905