Geodesic
Estimate of the number of edges in subgraphs of a Johnson graph
Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ, Tome 499 (2021), pp. 40-43.

Voir la notice de l'article provenant de la source Math-Net.Ru

New estimates for the minimum number of edges in subgraphs of a Johnson graph are obtained.
Keywords: Johnson graph, distance graphs, Turán's theorem. 
@article{DANMA_2021_499_a8,
     author = {Ph. A. Pushnyakov and A. M. Raigorodskii},
     title = {Estimate of the number of edges in subgraphs of a {Johnson} graph},
     journal = {Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleni\^a},
     pages = {40--43},
     publisher = {mathdoc},
     volume = {499},
     year = {2021},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DANMA_2021_499_a8/}
}
TY  - JOUR
AU  - Ph. A. Pushnyakov
AU  - A. M. Raigorodskii
TI  - Estimate of the number of edges in subgraphs of a Johnson graph
JO  - Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ
PY  - 2021
SP  - 40
EP  - 43
VL  - 499
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DANMA_2021_499_a8/
LA  - ru
ID  - DANMA_2021_499_a8
ER  - 
%0 Journal Article
%A Ph. A. Pushnyakov
%A A. M. Raigorodskii
%T Estimate of the number of edges in subgraphs of a Johnson graph
%J Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ
%D 2021
%P 40-43
%V 499
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DANMA_2021_499_a8/
%G ru
%F DANMA_2021_499_a8
Ph. A. Pushnyakov; A. M. Raigorodskii. Estimate of the number of edges in subgraphs of a Johnson graph. Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ, Tome 499 (2021), pp. 40-43. http://geodesic.mathdoc.fr/item/DANMA_2021_499_a8/

[1] MacWilliams F.J., Sloane N.J.A., The theory of error-correcting codes, North-Holland, Amsterdam, 1977 | MR | Zbl

[2] Raigorodskii A.M., Koshelev M.M., “New bounds on clique-chromatic numbers of Johnson graphs”, Discrete and Applied Math., 283 (2020), 724–729 | DOI | MR | Zbl

[3] Kupavskii A.B., Sagdeev A.A., “Teoriya Ramseya v prostranstve s chebyshevskoi metrikoi”, UMN, 75:5 (455) (2020), 191–192 | DOI | MR | Zbl

[4] Sagdeev A.A., “On the Chromatic Numbers Corresponding to Exponentially Ramsey Sets”, J. Math. Sciences, 247:3 (2020), 488–497 | DOI | MR | Zbl

[5] Raigorodskii A.M., “O razbienii mnozhestv na chasti menshego diametra”, Doklady RAN. Matematika, informatika, protsessy upravleniya, 495 (2020), 74–77 | DOI | Zbl

[6] Pushnyakov F.A., Raigorodskii A.M., “Otsenka chisla reber v osobykh podgrafakh nekotorogo distantsionnogo grafa”, Matem. zametki, 107:2 (2020), 286–298 | DOI | MR | Zbl

[7] Shishunov E.D., Raigorodskii A.M., “O chislakh nezavisimosti nekotorykh distantsionnykh grafov s vershinami v $\{-1, 0, 1\}^n$”, DAN, 485:3 (2019) | MR | Zbl

[8] Prosanov R., “A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space”, Discrete Applied Mathematics, 276 (2020), 115–120 | DOI | MR | Zbl

[9] Prosanov R.I., “Kontrprimery k gipoteze Borsuka, imeyuschie bolshoi obkhvat”, Matem. zametki, 105:6 (2019), 890–898 | DOI | MR | Zbl

[10] Sagdeev A.A., “Ob odnoi teoreme Frankla-Uilsona”, Probl. peredachi inform., 55:4 (2019), 86–106 | DOI | MR | Zbl

[11] Berdnikov A.V., Raigorodskii A.M., “Otsenki chisel Borsuka po distantsionnym grafam spetsialnogo vida”, Problemy peredachi informatsii, 57:2 (2021), 44–50 | DOI | MR | Zbl

[12] Frankl P., Kupavskii A., “Almost intersecting families”, Electron. J. Comb., 28:2 (2021), P2.7, 16 pp. | MR | Zbl

[13] Frankl P., Kupavskii A., “Simple juntas for shifted families”, Discrete Anal., 2020, 14, 18 pp. | MR

[14] Shabanov D.A., Krokhmal N.E., Kravtsov D.A., “Panchromatic 3-colorings of random hypergraphs”, Europ. J. Combinatorics, 78 (2019), 28–43 | DOI | MR | Zbl

[15] Cherkashin D., Petrov F., “Regular behavior of the maximal hypergraph chromatic number”, SIAM J. Discrete Mathematics, 34:2 (2020), 1326–1333 | DOI | MR | Zbl

[16] Raigorodskii A.M., Cherkashin D.D., “Ekstremalnye zadachi v raskraskakh gipergrafov”, Uspekhi matem. nauk, 75:1 (2020), 95–154 | MR | Zbl

[17] Shabanov D.A., Shaikheeva T.M., “O predpisannom khromaticheskom chisle polnykh mnogodolnykh gipergrafov i kratnykh pokrytiyakh nezavisimymi mnozhestvami”, Matem. zametki, 107:3 (2020), 454–465 | DOI | MR | Zbl

[18] Semenov A., Shabanov D., “On the weak chromatic number of random hypergraphs”, Discrete Applied Mathematics, 276 (2020), 134–154 | DOI | MR | Zbl

[19] Akhmejanova M.B., Shabanov D.A., “Equitable colorings of hypergraphs with few edges”, Discrete Applied Mathematics, 276 (2020), 2–12 | DOI | MR | Zbl

[20] Raigorodskii A.M., Mikhailov K.A., “O chislakh Ramseya dlya polnykh distantsionnykh grafov s vershinami v $\{0, 1\}^n$”, Matem. sbornik, 200:12 (2009), 63–80 | DOI | Zbl

[21] Frankl P., Furedi Z., “Forbidding just one intersection”, J. Combinatorial Theory. Series A, 39 (1985), 160–176 | DOI | MR | Zbl