Erdős Problem #151
Statement
For a graph let denote the minimal number of vertices that include at least one from each maximal clique of on at least two vertices (sometimes called the clique transversal number). Let be maximal such that every triangle-free graph on vertices contains an independent set on vertices. If is a graph on vertices then is
Record
- Source
- Added
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.