Abstract
We study the asymptotic behavior of the independence number of a random subgraph of a certain (r, s)-distance graph. We provide upper and lower bounds for the critical edge survival probability under which a phase transition occurs, i.e., large new independent sets appear in the subgraph, which did not exist in the original graph.
Similar content being viewed by others
References
Bogolyubsky, L.I. and Raigorodskii, A.M., A Remark on Lower Bounds for the Chromatic Numbers of Spaces of Small Dimension with Metrics ℓ1 and ℓ2, Mat. Zametki, 2019, vol. 105, no. 2, pp. 187–213 [Math. Notes (Engl. Transl.), 2019, vol. 105, no. 1–2, pp. 180–203].
Székely, L.A., Erdős on Unit Distances and the Szemerédi–Trotter Theorems, Paul Erdős and His Mathematics, II (Proc. Conf. Held in Budapest, Hungary, July 4–11, 1999), Halász, G., Lovász, L., Simonovits, M., and Sós, V.T., Eds., Bolyai Soc. Math. Stud, vol. 11, Berlin: Springer; Budapest: János Bolyai Math. Soc., 2002, pp. 649–666.
Zakharov, D.A. and Raigorodskii, A.M., Clique Chromatic Numbers of Intersection Graphs, Mat. Zametki, 2019, vol. 105, no. 1, pp. 142–144 [Math. Notes (Engl. Transl.), 2019, vol. 105, no. 1–2, pp. 137–139].
Balogh, J., Cherkashin, D., and Kiselev, S., Coloring General Kneser Graphs and Hypergraphs via High-Discrepancy Hypergraphs, Europ. J. Combin., 2019, vol. 79, pp. 228–236.
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., Providence, RI: Amer. Math. Soc., 2014, pp. 93–109.
Boltyanski, V.G., Martini, H., and Soltan, P.S., Excursions into Combinatorial Geometry, Berlin: Springer, 1997.
Raigorodskii, A.M., Around the Borsuk Conjecture, 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].
Raigorodskii, A.M. and Cherkashin, D.D., Extremal Problems in Hypergraph Colourings, Uspekhi Mat. Nauk, 2020, vol. 75, no. 1 (451), pp. 95–154 [Russian Math. Surveys (Engl. Transl.), 2020, vol. 75, no. 1, pp. 89–146].
Prosanov, R.I., Counterexamples to Borsuk’s Conjecture with Large Girth, Mat. Zametki, 2019, vol. 105, no. 6, pp. 890–898 [Math. Notes (Engl. Transl.), 2019, vol. 105, no. 5–6, pp. 874–880].
Graham, R.L., Rothschild, B.L., and Spencer, J.H., Ramsey Theory, New York: Wiley, 1990, 2nd ed.
Kupavskii, A.B. and Sagdeev, A.A., Ramsey Theory in a Space with Chebyshev Metric, Uspekhi Mat. Nauk, 2020, vol. 75, no. 5 (455), pp. 191–192 [Russian Math. Surveys (Engl. Transl.), 2020, vol. 75, in press].
Pushnyakov, F.A., On the Number of Edges in Induced Subgraphs of Some Distance Graphs, Mat. Zametki, 2019, vol. 105, no. 4, pp. 592–602 [Math. Notes (Engl. Transl.), 2019, vol. 105, no. 3–4, pp. 582–591].
Sagdeev, A.A. and Raigorodskii, A.M., On a Frankl–Wilson Theorem and Its Geometric Corollaries, Acta Math. Univ. Comenian. (N.S.), 2019, vol. 88, no. 3, pp. 1029–1033.
Sagdeev, A.A., On a Frankl–Wilson Theorem, Probl. Peredachi Inf., 2019, vol. 55, no. 4, pp. 86–106 [Probl. Inf. Transm. (Engl. Transl.), 2019, vol. 55, no. 4, pp. 376–395].
Kupavskii, A., Degree Versions of Theorems on Intersecting Families via Stability, J. Combin. Theory Ser. A, 2019, vol. 168, pp. 272–287.
Ihringer, F. and Kupavskii, A., Regular Intersecting Families, Discrete Appl. Math., 2019, vol. 270, pp. 142–152.
Frankl, P. and Kupavskii, A., Partition-free Families of Sets, Proc. Lond. Math. Soc. (3), 2019, vol. 119, no. 2, pp. 440–468.
Frankl, P. and Kupavskii, A., Two Problems on Matchings in Set Families—In the Footsteps of Erdős and Kleitman, J. Combin. Theory Ser. B, 2019, vol. 138, pp. 286–313.
Kupavskii, A., Pach, J., and Tomon, I., On the Size of K-Cross-free Families, Combinatorica, 2019, vol. 39, no. 1, pp. 153–164.
Ipatov, M.M., Koshelev, M.M., and Raigorodskii, A.M., Modularity of Some Distance Graphs, Dokl. Ross. Akad. Nauk, 2020, vol. 490, no. 1, pp. 71–73 [Dokl. Math. (Engl. Transl.), 2020, vol. 101, no. 1, pp. 60–61].
Kiselev, S. and Kupavskii, A., Sharp Bounds for the Chromatic Number of Random Kneser Graphs, Acta Math. Univ. Comenian. (N.S.), 2019, vol. 88, no. 3, pp. 861–865.
Alishahi, M. and Hajiabolhassan, H., Chromatic Number of Random Kneser Hypergraphs, J. Combin. Theory Ser. A, 2018, vol. 154, pp. 1–20.
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].
Bobu, A.V., Kupriyanov, A.É., and Raigorodskii, A.M., A Generalization of Kneser Graphs, Mat. Zametki, 2020, vol. 107, no. 3, pp. 351–365 [Math. Notes (Engl. Transl.), 2020, vol. 107, no. 3–4, pp. 392–403].
Pyaderkin, M.M., On the Chromatic Number of Random Subgraphs of a Certain Distance Graph, Discrete Appl. Math., 2019, vol. 267, pp. 209–214.
Raigorodskii, A.M. and Koshelev, M.M., New Bounds on Clique-Chromatic Numbers of Johnson Graphs, Discrete Appl. Math., 2020, vol. 283, pp. 724–729.
Raigorodskii, A.M. and Koshelev, M.M., New Bounds for the Clique-Chromatic Numbers of Johnson Graphs, Dokl. Ross. Akad. Nauk, 2020, vol. 490, no. 1, pp. 78–80 [Dokl. Math. (Engl. Transl.), 2020, vol. 101, no. 1, pp. 66–67].
Raigorodskii, A.M. and Shishunov, E.D., On the Independence Number of Distance Graphs with Vertices in {−1, 0, 1}n, Dokl. Akad. Nauk, 2019, vol. 488, no. 5, pp. 486–487 [Dokl. Math. (Engl. Transl.), 2019, vol. 100, no. 2, pp. 476–477].
Raigorodskii, A.M. and Shishunov, E.D., On the Independence Numbers of Some Distance Graphs with Vertices in {−1, 0, 1}n, Dokl. Akad. Nauk, 2019, vol. 485, no. 3, pp. 269–271 [Dokl. Math. (Engl. Transl.), 2019, vol. 99, no. 2, pp. 165–166].
Pushnyakov, F.A. and Raigorodskii, A.M., Estimate of the Number of Edges in Special Subgraphs of a Distance Graph, Mat. Zametki, 2020, vol. 107, no. 2, pp. 286–298 [Math. Notes (Engl. Transl.), 2020, vol. 107, no. 1–2, pp. 322–332].
Bollobás, B., Narayanan, B.P., and Raigorodskii, A.M., On the Stability of the Erdős–Ko–Rado Theorem, J. Combin. Theory Ser. A, 2016, vol. 137, pp. 64–78.
Tran, T. and Das, S., A Simple Removal Lemma for Large Nearly-Intersecting Families, Ext. Abstr. 8th European Conf. on Combinatorics, Graph Theory and Applications (EuroComb’2015), Bergen, Norway, Aug. 31 – Sept. 4, 2015, Nešetril, J., Serra, O., Telle, J.A., Eds., Electron. Notes Discrete Math., 2015, vol. 49, pp. 93–99.
Balogh, J., Bollobás, B., and Narayanan, B.P., Transference for the Erdős–Ko–Rado Theorem, Forum Math. Sigma, 2015, vol. 3, Article e23, 18 pp.
Pyaderkin, M.M., On Threshold Probability for the Stability of Independent Sets in Distance Graphs, Mat. Zametki, 2019, vol. 106, no. 2, pp. 280–294 [Math. Notes (Engl. Transl.), 2020, vol. 106, no. 1–2, pp. 274–285].
Das, S. and Tran, T., Removal and Stability for Erdős–Ko–Rado, SIAM J. Discrete Math., 2016, vol. 30, no. 2, pp. 1102–1114.
Devlin, P. and Kahn, J., On “Stability” in the Erdős–Ko–Rado Theorem, SIAM J. Discrete Math., 2016, vol. 30, no. 2, pp. 1283–1289.
Funding
The research was carried out at the expense of the Russian Science Foundation, project no. 16-11-10014.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ogarok, P., Raigorodskii, A. On Stability of the Independence Number of a Certain Distance Graph. Probl Inf Transm 56, 345–357 (2020). https://doi.org/10.1134/S0032946020040055
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946020040055