Erdős Problem #610
Statement
For a graph let denote the minimal number of vertices that include at least one from each maximal clique of (sometimes called the clique transversal number). Estimate . In particular, is it true that if has vertices then for some , or even for some absolute constant ?
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.