olymmath

CN-TST 2014 Problem 11

  • Test 2

Find the smallest positive constant cc satisfying: For any simple graph G=G(V,E)G=G(V,E) , if ∣E∣≥c∣V∣|E|\geq c|V| , then GG contains 22 cycles with no common vertex, and one of them contains a chord.

Note: The cycle of graph G(V,E)G(V,E) is a set of distinct vertices v1,v2...,vn⊆V{v_1,v_2...,v_n}\subseteq V , vivi+1∈Ev_iv_{i+1}\in E for all 1≤i≤n1\leq i\leq n (n≥3,vn+1=v1)(n\geq 3, v_{n+1}=v_1) ; a cycle containing a chord is the cycle v1,v2...,vn{v_1,v_2...,v_n} , such that there exist i,j,1<i−j<n−1i,j, 1< i-j< n-1 , satisfying vivj∈Ev_iv_j\in E .

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 cn-tst/2014/p11 · Tag AEK50NEP8V · Edit this page on GitHub · Keys: j next, k previous