Skip to main content
SpringerLink
Log in

Lower Bound on the Minimum Number of Edges in Subgraphs of Johnson Graphs

  • LARGE SYSTEMS
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We prove a new lower bound on the minimum number of edges in subgraphs of Johnson graphs in the general case.

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. Frankl, P. and Wilson, R.M., Intersection Theorems with Geometric Consequences, Combinatorica, 1981, vol. 1, no. 4, pp. 357–368. https://doi.org/10.1007/BF02579457

    Article  MathSciNet  MATH  Google Scholar 

  2. Kahn, J. and Kalai, G., A Counterexample to Borsuk’s Conjecture, Bull. Amer. Math.Soc.(N.S.), 1993, vol. 29, no. 1, pp. 60–62. https://doi.org/10.1090/S0273-0979-1993-00398-7

    Article  MathSciNet  MATH  Google Scholar 

  3. Raigorodskii, A.M., Cliques and Cycles in Distance Graphs and Graphs of Diameters, Discrete Geometry and Algebraic Combinatorics (AMS Special Session on Discrete Geometry and Algebraic Combinatorics, San Diego, CA, USA, Jan. 11, 2013), Barg, A. and Musin, O.R., Eds., Contemp. Math., vol. 625, Providence, RI: Amer. Math. Soc., 2014, pp. 93–109.

    MathSciNet  MATH  Google Scholar 

  4. Boltyanski, V.G., Martini, H., and Soltan, P.S., Excursions into Combinatorial Geometry, Berlin: Springer, 1997.

    Book  MATH  Google Scholar 

  5. Raigorodskii, A.M., Around Borsuk’s Hypothesis, Sovrem. Mat. Fundam. Napravl., 2007, vol. 23, pp. 147–164 [J. Math. Sci. (N.Y.) (Engl. Transl.), 2007, vol. 154, no. 4, pp. 604–623]. https://doi.org/10.1007/s10958-008-9196-y

    Google Scholar 

  6. Hinrichs, A. and Richter, C., New Sets with Large Borsuk Numbers, Discrete Math., 2003, vol. 270, no. 1–3, pp. 137–147. https://doi.org/10.1016/S0012-365X(02)00833-6

    Article  MathSciNet  MATH  Google Scholar 

  7. Balogh, J., Cherkashin, D., and Kiselev, S., Coloring General Kneser Graphs and Hypergraphs via High-Discrepancy Hypergraphs, European J. Combin., 2019, vol. 79, pp. 228–236. https://doi.org/10.1016/j.ejc.2019.03.004

    Article  MathSciNet  MATH  Google Scholar 

  8. Berdnikov, A.V. and Raigorodskii, A.M., Bounds on Borsuk Numbers in Distance Graphs of a Special Type, Probl. Peredachi Inf., 2021, vol. 57, no. 2, pp. 44–50 [Probl. Inf. Transm. (Engl. Transl.), 2021, vol. 57, no. 2, pp. 136–142]. https://doi.org/10.1134/S0032946021020034

    MathSciNet  MATH  Google Scholar 

  9. Ogarok, P.A. and Raigorodskii, A.M., On Stability of the Independence Number of a Certain Distance Graph, Probl. Peredachi Inf., 2020, vol. 56, no. 4, pp. 50–63 [Probl. Inf. Transm. (Engl. Transl.), 2020, vol. 56, no. 4, pp. 345–357]. https://doi.org/10.1134/S0032946020040055

    MathSciNet  MATH  Google Scholar 

  10. Balogh, J., Krueger, R.A., and Luo, H., Sharp Threshold for the Erdős–Ko–Rado Theorem, Random Structures Algorithms, 2022, Early View Research Article, https://doi.org/10.1002/rsa.21090

  11. Delsarte, P., An Algebraic Approach to the Association Schemes of Coding Theory, Philips Res. Rep. Suppl., 1973, no. 10 (97 pp.).

  12. Brouwer, A.E., Cioabă, S.M., Ihringer, F., and McGinnis, M., The Smallest Eigenvalues of Hamming Graphs, Johnson Graphs and Other Distance-Regular Graphs with Classical Parameters, J. Combin. Theory Ser. B, 2018, vol. 133, pp. 88–121. https://doi.org/10.1016/j.jctb.2018.04.005

    Article  MathSciNet  MATH  Google Scholar 

  13. Lovász, L., On the Shannon Capacity of a Graph, IEEE Trans. Inform. Theory, 1979, vol. 25, no. 1, pp. 1–7. https://doi.org/10.1109/TIT.1979.1055985

    Article  MathSciNet  MATH  Google Scholar 

  14. Frankl, P. and Füredi, Z., Forbidding Just One Intersection, J. Combin. Theory Ser. A, 1985, vol. 39, no. 2, pp. 160–176. https://doi.org/10.1016/0097-3165(85)90035-4

    Article  MathSciNet  MATH  Google Scholar 

  15. Shubin, Ya.K. On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs, Mat. Zametki, 2022, vol. 111, no. 6, pp. 929–939 [Math. Notes (Engl. Transl.), 202, vol. 111, no. 5–6, pp. 961–969]. https://doi.org/10.1134/S0001434622050303

    MathSciNet  Google Scholar 

  16. Pushnyakov, F.A., The Number of Edges in Induced Subgraphs of Special Distance Graphs, Cand. Sci. (Phys.-Math.) Dissertation, Moscow: Moscow Institute of Physics and Technology (State University), 2020.

    Google Scholar 

  17. Mikhailov, K.A. and Raigorodskii, A.M., On the Ramsey Numbers for Complete Distance Graphs with Vertices in \(\{0,1\}^n\), Mat. Sb., 2009, vol. 200, no. 12, pp. 63–80 [Sb. Math. (Engl. Transl.), 2009, vol. 200, no. 12, pp. 1789–1806]. https://doi.org/10.1070/SM2009v200n12ABEH004059

    MathSciNet  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

    Ya. K. Shubin

Authors
  1. Ya. K. Shubin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Problemy Peredachi Informatsii, 2022, Vol. 58, No. 4, pp. 95–102. https://doi.org/10.31857/S0555292322040088

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shubin, Y. Lower Bound on the Minimum Number of Edges in Subgraphs of Johnson Graphs. Probl Inf Transm 58, 382–388 (2022). https://doi.org/10.1134/S0032946022040081

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation