ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, the star chromatic number χs(G)\chi_s(G) is the minimum number of colors in a proper coloring such that any two color classes induce a star forest. A graph is K1,tK_{1,t}-free if it has no induced subgraph isomorphic to K1,tK_{1,t}. Karthick's conjecture. The class of all K1,tK_{1,t}-free graphs, where t≥3t\geq 3, is χs\chi_s-bounded.

This conjecture concerns star colorings under a natural forbidden-induced-subgraph condition. The supplied text gives no resolution status, while noting that Karthick introduced the notion of χs\chi_s-boundedness and proposed this conjecture.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.