Scott's induced subdivision conjecture for maximal triangle-free graphs

Details Scott's induced subdivision conjecture for maximal triangle-free graphs Scott's induced subdivision conjecture for maximal triangle-free graphs

2011-07-18

arxiv.org/abs/1107.3491v1

Mathematics

Combinatorics

Scientific paper

Scott conjectured that the class of graphs with no induced subdivision of a
given graph is $\chi$-bounded. We verify his conjecture for maximal
triangle-free graphs.

Affiliated with

Also associated with

No associations

Rating

Scott's induced subdivision conjecture for maximal triangle-free graphs 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 Scott's induced subdivision conjecture for maximal triangle-free graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scott's induced subdivision conjecture for maximal triangle-free graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-272033