The joints problem for matroids

We prove that in a simple matroid, the maximal number of joints formed by L lines is o ( L 2 ) and ? ( L 2 - ? ) for any ? 0 .

[1]  James G. Oxley,et al.  Matroid theory , 1992 .

[2]  F. Behrend.  On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1946, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Leonidas J. Guibas,et al.  Counting and cutting cycles of lines and rods in space , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[4]  René Quilodrán.  The Joints Problem in $\mathbb{R}^n$ , 2009 .

[5]  David Conlon,et al.  Graph removal lemmas , 2012, Surveys in Combinatorics.

[6]  Larry Guth,et al.  Algebraic methods in discrete analogs of the Kakeya problem , 2008, 0812.1043.

[7]  Haim Kaplan,et al.  On Lines and Joints , 2009, Discret. Comput. Geom..

[8]  J. Oxley.  Matroid Theory (Oxford Graduate Texts in Mathematics) , 2006 .

[9]  Haim Kaplan,et al.  On lines, joints, and incidences in three dimensions , 2009, J. Comb. Theory, Ser. A.