does anyone have an idea on proving that there is a triangle-free k-chromatic graph for every positive integer k?(adsbygoogle = window.adsbygoogle || []).push({});

or, how to prove that given a simplicial ordering on a chordal graph G, running the greedy coloring algorithm on the reverse order gives the optimal coloring on the complement graph?

one might think to use induction but it's all very messy and ecchhh

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# More graph theory

Loading...

Similar Threads - More graph theory | Date |
---|---|

Which mathematical objects are more common in nature? | Dec 4, 2017 |

Math problem, but I think it is more appropriate here | Dec 16, 2016 |

How to graph 5 or more variables at once? | Nov 21, 2008 |

Do Equations in More Than Three Variables Represent Graphs in Higher Dimensions? | Dec 21, 2007 |

Do Equations in More Than Three Variables Represent Graphs in Higher Dimensions? | Dec 12, 2007 |

**Physics Forums - The Fusion of Science and Community**