The joints problem for matroids

Author(s)
Guth, Lawrence; Suk, Andrew
Thumbnail
Download1308.3773.pdf (191.8Kb)
PUBLISHER_CC
Terms of use
Creative Commons Attribution-NonCommercial-NoDerivs License http://creativecommons.org/licenses/by-nc-nd/4.0/
Metadata
Show full item record
Abstract
We prove that in a simple matroid, the maximal number of joints formed by L lines is o(L[superscript 2]) and Ω(L[superscript 2-ε]) for any ε > 0. Keywords: Matroids, The joints problem, Arithmetic progression
Date issued
2015-04
URI
http://hdl.handle.net/1721.1/115574
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Journal of Combinatorial Theory, Series A
Publisher
Elsevier BV
Citation
Guth, Larry, and Andrew Suk. “The Joints Problem for Matroids.” Journal of Combinatorial Theory, Series A, vol. 131, Apr. 2015, pp. 71–87.
Version: Author's final manuscript
ISSN
0097-3165
Collections