olymmath

RO-TST 1999 Problem 16

    Let XX be a set with nn elements, and let A1A_{1} , A2A_{2} , ..., AmA_{m} be subsets of XX such that:

    1. ∣Ai∣=3|A_{i}|=3 for every i∈{1,2,...,m}i\in\left\{1,2,...,m\right\} ;
    2. ∣Ai∩Aj∣≤1|A_{i}\cap A_{j}|\leq 1 for all i,j∈{1,2,...,m}i,j\in\left\{1,2,...,m\right\} such that i≠ji \neq j .

    Prove that there exists a subset AA of XX such that AA has at least [2n]\left[\sqrt{2n}\right] elements, and for every i∈{1,2,...,m}i\in\left\{1,2,...,m\right\} , the set AA does not contain AiA_{i} .

    Alternative formulation. Let XX be a finite set with nn elements and A1,A2,…,AmA_{1},A_{2},\ldots, A_{m} be three-elements subsets of XX , such that ∣Ai∩Aj∣≤1|A_{i}\cap A_{j}|\leq 1 , for every i≠ji\neq j . Prove that there exists A⊆XA\subseteq X with ∣A∣≥⌊2n⌋|A|\geq \lfloor \sqrt{2n}\rfloor , such that none of AiA_{i} 's is a subset of AA .

    Dataset text AI-MO AoPS. 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 ro-tst/1999/p16 · Tag DHS3991GGH · Edit this page on GitHub · Keys: j next, k previous