2016/12/30 by Vaidy Sivaraman · 1 citation
Mathematics · #math.CO #msc:05C15 #msc:05C75
paper · pdf · doi:10.1016/j.dam.2017.10.021
published as Discrete Applied Mathematics, 236 (2018) 422-427 · 8 pages
arxiv created 2016/12/30 · arxiv updated 2018/01/08
We discuss some problems related to induced subgraphs. The first problem is about getting a good upper bound for the chromatic number in terms of the clique number for graphs in which every induced cycle has length 3 or 4. The second problem is about the perfect chromatic number of a graph, which is the smallest number of perfect sets into which the vertex set of a graph can be partitioned. (A set of vertices is said to be perfect it it induces a perfect graph.) The third problem is on antichains in the induced subgraph ordering. The fourth problem is on graphs in which the difference between the chromatic number and the clique number is at most one for every induced subgraph of the graph. The fifth problem is on a weakening of the notorious Erdős-Hajnal conjecture. The last problem is on a conjecture of Gyárfás about χ-boundedness of a particular class of graphs.