Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference9 articles.
1. J. E. Bonin and H. Qin: Size functions of subgeometry-closed classes of representable combinatorial geometries, Discrete Math. 224 (2000), 37–60.
2. R. C. Bose and R. C. Burton: A characterization of at spaces in a finite geometry and the uniqueness of the Hamming and MacDonald codes, J. Combin. Theory 1 (1966), 96–104.
3. H. H. Crapo and G.-C. Rota: On the foundations of combinatorial theory: Combinatorial geometries, M.I.T. Press, Cambridge, Mass., 1970.
4. P. Dodos, V. Kanellopoulos and K. Tyros: A simple proof of the density Hales-Jewett theorem, Internat. Math. Res. Notices, to appear.
5. P. Erdős and A. H. Stone: On the structure of linear graphs, Bull. Amer. Math. Soc. 52 (1946), 1087–1091.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Excluding Affine Configurations over a Finite Field;DISCRETE ANAL;2023
2. Upper bounds on Ramsey numbers for vector spaces over finite fields;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
3. On vertex-induced weighted Turán problems;Discrete Mathematics;2022-01
4. The structure of claw-free binary matroids;Journal of Combinatorial Theory, Series B;2021-09
5. Stability and exact Turán numbers for matroids;Journal of Combinatorial Theory, Series B;2020-07