Stability and exact Turán numbers for matroids
暂无分享,去创建一个
Peter Nelson | Hong Liu | Kazuhiro Nomoto | Sammy Luo | Hong Liu | P. Nelson | Sammy Luo | K. Nomoto
[1] Miklós Simonovits. How to solve a Turán type extremal graph problem? (Linear decomposition) , 1997, Contemporary Trends in Discrete Mathematics.
[2] Peter Nelson,et al. An analogue of the Erdős-Stone theorem for finite geometries , 2014, Combinatorica.
[3] Sammy Luo,et al. A counting lemma for binary matroids and applications to extremal problems , 2016, J. Comb. Theory, Ser. B.
[4] Jonathan Tidor,et al. Dense binary PG(t - 1, 2)-free matroids have critical number t - 1 or t , 2015, J. Comb. Theory, Ser. B.
[5] Jim Geelen,et al. A geometric version of the Andrásfai-Erdős-Sós Theorem , 2014, Adv. Appl. Math..
[6] Shachar Lovett,et al. General systems of linear forms: equidistribution and true complexity , 2014, Electron. Colloquium Comput. Complex..
[7] Shachar Lovett,et al. Every locally characterized affine-invariant property is testable , 2013, STOC '13.
[8] JIM GEELEN,et al. Odd circuits in dense binary matroids , 2014, Comb..
[9] Leo Storme,et al. The classification of the smallest nontrivial blocking sets in PG(n, 2) , 2006, J. Comb. Theory, Ser. A.
[10] Miklós Simonovits,et al. Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions , 1974, Discret. Math..
[11] R. C. Bose,et al. A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes , 1966 .
[12] Peter Nelson,et al. The critical number of dense triangle-free binary matroids , 2014, J. Comb. Theory, Ser. B.
[13] Joseph E. Bonin,et al. Size functions of subgeometry-closed classes of representable combinatorial geometries , 2000, Discret. Math..
[14] James G. Oxley,et al. Matroid theory , 1992 .
[15] W. T. Gowers,et al. The true complexity of a system of linear equations , 2007, 0711.0185.