On the number of edges in induced subgraphs of a special distance graph

被引：0

|

作者：

F. A. Pushnyakov

机构：

[1] Moscow Institute of Physics and Technology,

来源：

Mathematical Notes | 2016年 / 99卷

关键词：

distance graph; clique; cycle; coloring; Borsuk problem;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We obtain new estimates for the number of edges in induced subgraphs of a special distance graph.

引用

收藏

页码：545 / 551

页数：6

相关论文

共 50 条

[1] On the number of edges in induced subgraphs of a special distance graph
Pushnyakov, F. A.
MATHEMATICAL NOTES, 2016, 99 (3-4) : 545 - 551
[2] A new estimate for the number of edges in induced subgraphs of a special distance graph
Ph. A. Pushnyakov
Problems of Information Transmission, 2015, 51 : 371 - 377
[3] A new estimate for the number of edges in induced subgraphs of a special distance graph
Pushnyakov, Ph. A.
PROBLEMS OF INFORMATION TRANSMISSION, 2015, 51 (04) : 371 - 377
[4] Estimate of the Number of Edges in Special Subgraphs of a Distance Graph
Pushnyakov, F. A.
Raigorodskii, A. M.
MATHEMATICAL NOTES, 2020, 107 (1-2) : 322 - 332
[5] Estimate of the Number of Edges in Special Subgraphs of a Distance Graph
F. A. Pushnyakov
A. M. Raigorodskii
Mathematical Notes, 2020, 107 : 322 - 332
[6] On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs
Shubin, Ya K.
MATHEMATICAL NOTES, 2022, 111 (5-6) : 961 - 969
[7] On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs
Ya. K. Shubin
Mathematical Notes, 2022, 111 : 961 - 969
[8] The Number of Edges in Induced Subgraphs of Some Distance Graphs
F. A. Pushnyakov
Mathematical Notes, 2019, 105 : 582 - 591
[9] The Number of Edges in Induced Subgraphs of Some Distance Graphs
Pushnyakov, F. A.
MATHEMATICAL NOTES, 2019, 105 (3-4) : 582 - 591
[10] Estimate of the Number of Edges in Subgraphs of a Johnson Graph
Pushnyakov, F. A.
Raigorodskii, A. M.
DOKLADY MATHEMATICS, 2021, 104 (01) : 193 - 195

← 1 2 3 4 5 →