Odd circuits in dense binary matroids
暂无分享,去创建一个
[1] Terence Tao,et al. Additive combinatorics , 2007, Cambridge studies in advanced mathematics.
[2] G. Rota,et al. On The Foundations of Combinatorial Theory: Combinatorial Geometries , 1970 .
[3] James G. Oxley,et al. Matroid theory , 1992 .
[4] Carsten Thomassen. On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree , 2007, Comb..
[5] Carsten Thomassen,et al. On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree , 2002, Comb..
[6] G. Grimmett,et al. Combinatorics, complexity, and chance : a tribute to Dominic Welsh , 2007 .
[7] $IP_r $-sets, Szemerédi's theorem, and Ramsey theory , 1986 .
[8] Miklós Simonovits,et al. On a valence problem in extremal graph theory , 1973, Discret. Math..
[9] J. Oxley. THE CONTRIBUTIONS OF DOMINIC WELSH TO MATROID THEORY , 2007 .
[10] B. Green. A Szemerédi-type regularity lemma in abelian groups, with applications , 2003, math/0310476.