46 citations to 10.1112/plms/s3-36.2.369 (Crossref Cited-By Service)
  1. Tomasz Schoen, Ilya D. Shkredov, “An Upper Bound for Weak $B_k$-Sets”, SIAM J. Discrete Math., 33, № 2, 2019, 837  crossref
  2. Miklós Simonovits, Vera T. Sós, 6, Combinatorial Mathematics, Optimal Designs and Their Applications, 1980, 301  crossref
  3. M. Deza, N.M. Singhi, 6, Combinatorial Mathematics, Optimal Designs and Their Applications, 1980, 57  crossref
  4. P. Frankl, A.M. Odlyzko, “On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer”, European Journal of Combinatorics, 4, № 3, 1983, 215  crossref
  5. Vishnu V. Ratnam, Andreas F. Molisch, Ozgun Y. Bursalioglu, Haralabos C. Papadopoulos, “Hybrid Beamforming With Selection for Multiuser Massive MIMO Systems”, IEEE Trans. Signal Process., 66, № 15, 2018, 4105  crossref
  6. A. V. Bobu, A. E. Kupriyanov, A. M. Raigorodskii, “On the Number of Edges of a Uniform Hypergraph with a Range of Allowed Intersections”, Probl Inf Transm, 53, № 4, 2017, 319  crossref
  7. A. M. Raigorodskii, “Around Borsuk’s hypothesis”, J Math Sci, 154, № 4, 2008, 604  crossref
  8. P. Frankl, “Pseudo sunflowers”, European Journal of Combinatorics, 104, 2022, 103553  crossref
  9. Seog-Jin Kim, Boram Park, “Improved bounds on the chromatic numbers of the square of Kneser graphs”, Discrete Mathematics, 315-316, 2014, 69  crossref
  10. Zoltán Füredi, “Linear trees in uniform hypergraphs”, European Journal of Combinatorics, 35, 2014, 264  crossref
Предыдущая
1
2
3
4
5
Следующая