ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG let τ(G)\tau(G) denote the minimal number of vertices that include at least one from each maximal clique of GG (sometimes called the clique transversal number). Is it true that if all maximal cliques in GG have at least cncn vertices then τ(G)=oc(n)\tau(G)=o_c(n)? Similarly, estimate for c>0c>0 the minimal kc(n)k_c(n) such that if every maximal clique in GG has at least kc(n)k_c(n) vertices then τ(G)<(1−c)n\tau(G)<(1-c)n.

Record

Added
Links

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.