关于图K3,3的Turàn数下界的另一个证明思路

A New Idea of Proving a Lower Bound of Turàn Number about Graph K3,3

结合Wenger和Brown的构造方法，提出利用基本代数知识给出关于ex（N；K3,3）下界的另外证明思路及问题。

This paper poses an idea and a problem to prove the lower bound of Turdn number ex （N; K3,3 ）, which is based on the algebra constructing methods of Wenger and Brown.