olymmath

KöMaL 2011 A531

    Prove that for every positive integer kk there is a positive integer NkN_k (depending only on kk) such that whenever C\mathcal{C} is a set system whose elements are at most kk-element sets such that every two elements of C\mathcal{C} have an element in common, then there exists a set AA with at most NkN_k elements such that every two elements of C\mathcal{C} and AA have an element in common.

    Official text KöMaL. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator hu-komal/2011/a531 · Tag 3R6ABPQX92 · Edit this page on GitHub · Keys: j next, k previous