Erdős Problem #611
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). Is it true that if all maximal cliques in have at least vertices then ? Similarly, estimate for the minimal such that if every maximal clique in has at least vertices then .
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.