Skip to main content
SpringerLink
Log in

On the Number of Edges of a Uniform Hypergraph with a Range of Allowed Intersections

  • Coding Theory
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We study the quantity p(n, k, t1, t2) equal to the maximum number of edges in a k-uniform hypergraph having the property that all cardinalities of pairwise intersections of edges lie in the interval [t1, t2]. We present previously known upper and lower bounds on this quantity and analyze their interrelations. We obtain new bounds on p(n, k, t1, t2) and consider their possible applications in combinatorial geometry problems. For some values of the parameters we explicitly evaluate the quantity in question. We also give a new bound on the size of a constant-weight error-correcting code.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahlswede, R. and Khachatrian, L.H., The Complete Intersection Theorem for Systems of Finite Sets, Europ. J. Combin., 1997, vol. 18, no. 2, pp. 125–136.

    Article  MathSciNet  MATH  Google Scholar 

  2. Ahlswede, R. and Khachatrian, L.H., The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets, J. Combin. Theory Ser. A, 1996, vol. 76, no. 1, pp. 121–138.

    Article  MathSciNet  MATH  Google Scholar 

  3. Varsamov, R.R., Estimate of the Number of Signals in Error Correcting Codes, Dokl. Akad. Nauk SSSR, 1957, vol. 117, no. 5, pp. 739–741.

    MathSciNet  Google Scholar 

  4. Gilbert, E.N., A Comparison of Signalling Alphabets, Bell Syst. Tech. J., 1952, vol. 31, no. 3, pp. 504–522.

    Article  Google Scholar 

  5. Hamming, R.W., Error Detecting and Error Correcting Codes, Bell Syst. Tech. J., 1950, vol. 29, no. 2, pp. 147–160.

    Article  MathSciNet  Google Scholar 

  6. Bassalygo, L.A., New Upper Bounds for Error Correcting Codes, Probl. Peredachi Inf., 1965, vol. 1, no. 4, pp. 41–44 [Probl. Inf. Trans. (Engl. Transl.), 1965, vol. 1, no. 4, pp. 32–35].

    MathSciNet  MATH  Google Scholar 

  7. Levenshtein, V.I., Upper-Bound Estimates for Fixed-Weight Codes, Probl. Peredachi Inf., 1971, vol. 7, no. 4, pp. 3–12 [Probl. Inf. Trans. (Engl. Transl.), 1971, vol. 7, no. 4, pp. 281–287].

    MATH  Google Scholar 

  8. McEliece, R.J., Rodemich, E.R., Rumsey, H., Jr., and Welch, L.R., New Upper Bounds on the Rate of a Code via the Delsarte–MacWilliams Inequalities, IEEE Trans. Inform. Theory, 1977, vol. 23, no. 2, pp. 157–166.

    Article  MathSciNet  MATH  Google Scholar 

  9. MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz’, 1979.

    MATH  Google Scholar 

  10. Larman, D.G. and Rogers, C.A., The Realization of Distances within Sets in Euclidean Space, Mathematika, 1972, vol. 19, no. 1, pp. 1–24.

    Article  MathSciNet  MATH  Google Scholar 

  11. Delsarte, P., Goethals, J.-M., and Seidel, J.J., Spherical Codes and Designs, Geom. Dedicata, 1977, vol. 6, no. 3, pp. 363–388.

    Article  MathSciNet  MATH  Google Scholar 

  12. Frankl, P. and Wilson, R., Intersection Theorems with Geometric Consequences, Combinatorica, 1981, vol. 1, no. 4, pp. 357–368.

    Article  MathSciNet  MATH  Google Scholar 

  13. Nagy, Z., A Certain Constructive Estimate of the Ramsey Number, Matem. Lapok, 1972, vol. 23, pp. 301–302.

    MathSciNet  Google Scholar 

  14. Frankl, P., Extremal Problems and Coverings of the Space, Europ. J. Combin., 1980, vol. 1, no. 2, pp. 101–106.

    Article  MathSciNet  MATH  Google Scholar 

  15. Frankl, P. and Füredi, Z., Forbidding Just One Intersection, J. Combin. Theory Ser. A, 1985, vol. 39, no. 2, pp. 160–176.

    Article  MathSciNet  MATH  Google Scholar 

  16. Rödl, V., On a Packing and Covering Problem, Europ. J. Combin., 1985, vol. 6, no. 1, pp. 69–78.

    Article  MathSciNet  MATH  Google Scholar 

  17. Balogh, J., Kostochka, A.V., and Raigorodskii, A.M., Coloring Some Finite Sets in RN, Discuss. Math. Graph Theory, 2013, vol. 33, no. 1, pp. 25–31.

    Article  MathSciNet  MATH  Google Scholar 

  18. Raigorodskii, A.M., Combinatorial Geometry and Coding Theory, Fundam. Inform., 2016, vol. 145, no. 3, pp. 359–369.

    Article  MathSciNet  MATH  Google Scholar 

  19. Pyaderkin, M.M. and Raigorodskii, A.M., On Random Subgraphs of Kneser Graphs and Their Generalizations, Dokl. Akad. Nauk, 2016, vol. 470, no. 4, pp. 384–386 [Dokl. Math. (Engl. Transl.), 2016, vol. 94, no. 2, pp. 547–549].

    MATH  Google Scholar 

  20. Pyaderkin, M.M., On the Stability of Some Erdős–Ko–Rado Type Results, Discrete Math., 2017, vol. 340, no. 4, pp. 822–831.

    Article  MathSciNet  MATH  Google Scholar 

  21. Cherkashin, D.D. and Raigorodskii, A.M., On the Chromatic Numbers of Low-Dimensional Spaces, Dokl. Akad. Nauk, 2017, vol. 472, no. 1, pp. 11–12 [Dokl. Math. (Engl. Transl.), 2017, vol. 95, no. 1, pp. 5–6].

    MATH  Google Scholar 

  22. Bobu, A.V., Kostina, O.A., and Kupriyanov, A.E., Independence Numbers and Chromatic Numbers of Some Distance Graphs, Probl. Peredachi Inf., 2015, vol. 51, no. 2, pp. 86–98 [Probl. Inf. Trans. (Engl. Transl.), 2015, vol. 51, no. 2, pp. 165–176].

    MathSciNet  MATH  Google Scholar 

  23. Frankl, P. and Rödl, V., Forbidden Intersections, Trans. Amer. Math. Soc., 1987, vol. 300, no. 1, pp. 259–286.

    Article  MathSciNet  MATH  Google Scholar 

  24. Frankl, P. and Rödl, V., All Triangles are Ramsey, Trans. Amer. Math. Soc., 1986, vol. 297, no. 2, pp. 777–779.

    Article  MathSciNet  MATH  Google Scholar 

  25. Frankl, P. and Rödl, V., A Partition Property of Simplices in Euclidean Space, J. Amer. Math. Soc., 1990, vol. 3, no. 1, pp. 1–7.

    Article  MathSciNet  MATH  Google Scholar 

  26. Raigorodskii, A.M., The Borsuk Problem and the Chromatic Numbers of Some Metric Spaces, Uspekhi Mat. Nauk, 2001, vol. 56, no. 1, pp. 107–146 [Russian Math. Surveys (Engl. Transl.), 2001, vol. 56, no. 1, pp. 103–139].

    Article  MathSciNet  Google Scholar 

  27. Ponomarenko, E.I. and Raigorodskii, A.M., New Estimates in the Problem of the Number of Edges in a Hypergraph with Forbidden Intersections, Probl. Peredachi Inf., 2013, vol. 49, no. 4, pp. 98–104 [Probl. Inf. Trans. (Engl. Transl.), 2013, vol. 49, no. 4, pp. 384–390].

    MathSciNet  MATH  Google Scholar 

  28. Ponomarenko, E.I. and Raigorodskii, A.M., An Improvement of the Frankl–Wilson Theorem on the Number of Edges in a Hypergraph with Forbidden Intersection of Edges, Dokl. Akad. Nauk, 2014, vol. 454, no. 3, pp. 268–269 [Dokl. Math. (Engl. Transl.), 2014, vol. 89, no. 1, pp. 59–60].

    MathSciNet  MATH  Google Scholar 

  29. Ponomarenko, E.I. and Raigorodskii, A.M., New Upper Bounds for the Independence Numbers of Graphs with Vertices in {-1, 0, 1}n and Their Applications to Problems of the Chromatic Numbers of Distance Graphs, Mat. Zametki, 2014, vol. 96, no. 1, pp. 138–147 [Math. Notes (Engl. Transl.), 2014, vol. 96, no. 1–2, pp. 140–148].

    Article  MathSciNet  MATH  Google Scholar 

  30. Zvonarev, A.E., Raigorodskii, A.M., Samirov, D.V., and Kharlamova, A.A., On the Chromatic Number of a Space with a Forbidden Equilateral Triangle, Mat. Sb., 2014, vol. 205, no. 9, pp. 97–120 [Sb. Math. (Engl. Transl.), 2014, vol. 205, no. 9–10, pp. 1310–1333].

    Article  MathSciNet  MATH  Google Scholar 

  31. Zvonarev, A.E., Raigorodskii, A.M., Improvements of the Frankl–Rödl Theorem on the Number of Edges of a Hypergraph with Forbidden Intersections, and Their Consequences in the Problem of Finding the Chromatic Number of a Space with Forbidden Equilateral Triangle, Tr. Mat. Inst. Steklova, 2015, vol. 288, pp. 109–119 [Proc. Steklov Inst. Math. (Engl. Transl.), 2015, vol. 288, no. 1, pp. 94–104].

    MATH  Google Scholar 

  32. Raigorodskii, A.M. and Sagdeev, A.A., On the Chromatic Number of a Space with a Forbidden Regular Simplex, Dokl. Akad. Nauk, 2017, vol. 472, no. 2, pp. 127–129 [Dokl. Math. (Engl. Transl.), 2017, vol. 95, no. 1, pp. 15–16].

    MathSciNet  MATH  Google Scholar 

  33. Sagdeev, A.A., On Lower Bounds for the Chromatic Numbers of Distance Graphs with Large Girth, Mat. Zametki, 2014, vol. 101, no. 3, pp. 430–445 [Math. Notes (Engl. Transl.), 2014, vol. 101, no. 3–4, pp. 515–528].

    Article  MathSciNet  Google Scholar 

  34. Prosanov, R.I., Raigorodskii, A.M., and Sagdeev, A.A., Improvements of the Frankl–Rödl Theorem and Geometric Consequences, Dokl. Akad. Nauk, 2017, vol. 475, no. 2, pp. 137–139 [Dokl. Math. (Engl. Transl.), 2017, vol. 96, no. 1, pp. 336–338].

    Google Scholar 

  35. Sagdeev, A.A., On a Frankl–Rödl Theorem and Its Geometric Corollaries, Electron. Notes Discrete Math., 2017, vol. 61, pp. 1033–1037.

    Article  MATH  Google Scholar 

  36. Bobu, A.V., Kupriyanov, A.E., and Raigorodskii, A.M., On the Maximum Number of Edges of a Uniform Hypergraph with One Forbidden Intersection, Dokl. Akad. Nauk, 2015, vol. 463, no. 1, pp. 11–13 [Dokl. Math. (Engl. Transl.), 2015, vol. 92, no. 1, pp. 401–403].

    MathSciNet  MATH  Google Scholar 

  37. Bobu, A.V., Kupriyanov, A.E., and Raigorodskii, A.M., Asymptotic Study of the Maximum Number of Edges in a Uniform Hypergraph with One Forbidden Intersection, Mat. Sb., 2016, vol. 207, no. 5, pp. 17–42 [Sb. Math. (Engl. Transl.), 2016, vol. 207, no. 5, pp. 652–677].

    Article  MathSciNet  MATH  Google Scholar 

  38. Bobu, A.V. and Kupriyanov, A.E., On Chromatic Numbers of Close-to-Kneser Distance Graphs, Probl. Peredachi Inf., 2016, vol. 52, no. 4, pp. 64–83 [Probl. Inf. Trans. (Engl. Transl.), 2016, vol. 52, no. 4, pp. 373–390].

    MathSciNet  MATH  Google Scholar 

  39. Bobu, A.V., Kupriyanov, A.E., and Raigorodskii, A.M., On the Chromatic Numbers of Distance Graphs That Are Similar to Kneser Graphs, Dokl. Akad. Nauk, 2016, vol. 468, no. 3, pp. 247–250 [Dokl. Math. (Engl. Transl.), 2016, vol. 93, no. 3, pp. 267–269].

    MathSciNet  MATH  Google Scholar 

  40. Ray-Chaudhuri, D.K. and Wilson, R.M., On t-Designs, Osaka J. Math., 1975, vol. 12, no. 3, pp. 737–744.

    MathSciNet  MATH  Google Scholar 

  41. Deza, M., Erdős, P., and Frankl, P., Intersection Properties of Systems of Finite Sets, Proc. London Math. Soc., 1978, vol. 3, no. 2, pp. 369–384.

    Article  MathSciNet  MATH  Google Scholar 

  42. Babai, L. and Frankl, P., On Set Intersections, J. Combin. Theory Ser. A, 1980, vol. 28, no. 1, pp. 103–105.

    Article  MathSciNet  MATH  Google Scholar 

  43. Frankl, P., Families of Finite Sets with Prescribed Cardinalities for Pairwise Intersections, Acta Math. Hungar., 1980, vol. 35, no. 3–4, pp. 351–360.

    Article  MathSciNet  MATH  Google Scholar 

  44. Mubayi, D. and Rödl, V., Specified Intersections, Trans. Amer. Math. Soc., 2014, vol. 366, no. 1, pp. 491–504.

    Article  MathSciNet  MATH  Google Scholar 

  45. Berdnikov, A.V. and Raigorodskii, A.M., On the Chromatic Number of Euclidean Space with Two Forbidden Distances, Mat. Zametki, 2014, vol. 96, no. 5, pp. 790–793 [Math. Notes (Engl. Transl.), 2016, vol. 96, no. 5–6, pp. 827–830].

    Article  MathSciNet  MATH  Google Scholar 

  46. Berdnikov, A.V., Estimate for the Chromatic Number of Euclidean Space with Several Forbidden Distances, Mat. Zametki, 2016, vol. 99, no. 5, pp. 783–787 [Math. Notes (Engl. Transl.), 2016, vol. 99, no. 5–6, pp. 774–778].

    Article  MathSciNet  MATH  Google Scholar 

  47. Raigorodskii, A.M. and Samirov, D.V., Chromatic Numbers of Spaces with Forbidden Monochromatic Triangles, Mat. Zametki, 2013, vol. 93, no. 1, pp. 117–126 [Math. Notes (Engl. Transl.), 2013, vol. 93, no. 1–2, pp. 163–171].

    Article  MathSciNet  MATH  Google Scholar 

  48. Samirov, D.V. and Raigorodskii, A.M., New Lower Bounds on the Chromatic Number of a Space with Forbidden Isosceles Triangles, in Itogi Nauki Tekh. Ser. Sovrem. Mat. Prilozh. Temat. Obz., vol. 125, Moscow: VINITI, 2013, pp. 252–268.

    MATH  Google Scholar 

  49. Samirov, D.V. and Raigorodskii, A.M., New Estimates in a Problem on the Chromatic Number of a Space with Forbidden Isosceles Triangles, Dokl. Akad. Nauk, 2014, vol. 456, no. 3, pp. 280–283 [Dokl. Math. (Engl. Transl.), 2014, vol. 89, no. 3, pp. 313–316].

    MathSciNet  MATH  Google Scholar 

  50. Samirov, D.V. and Raigorodskii, A.M., On Colorings with Forbidden Isosceles Triangles in Euclidean Spaces, Proc. Moscow Inst. Phys. Technol., 2015, vol. 7, no. 2, pp. 39–50.

    MATH  Google Scholar 

  51. Graham, R.L., Rothschild, B.L., and Spencer, J.H., Ramsey Theory, New York: Wiley, 1990, 2nd ed.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Statistics and Random Processes, Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, Moscow, Russia

    A. V. Bobu, A. E. Kupriyanov & A. M. Raigorodskii

  2. Department of Innovation and High Technology, Moscow Institute of Physics and Technology (State University), Moscow, Russia

    A. M. Raigorodskii

  3. Institute of Mathematics and Computer Science, Buryat State University, Ulan-Ude, Russia

    A. M. Raigorodskii

Authors
  1. A. V. Bobu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. E. Kupriyanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. M. Raigorodskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Bobu.

Additional information

Original Russian Text © A.V. Bobu, A.E. Kupriyanov, A.M. Raigorodskii, 2017, published in Problemy Peredachi Informatsii, 2017, Vol. 53, No. 4, pp. 16–42.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bobu, A.V., Kupriyanov, A.E. & Raigorodskii, A.M. On the Number of Edges of a Uniform Hypergraph with a Range of Allowed Intersections. Probl Inf Transm 53, 319–342 (2017). https://doi.org/10.1134/S0032946017040020

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946017040020

Search

Navigation