Estimates of the Number of Edges in Subgraphs of Johnson Graphs

IF 0.6 4区数学 Q3 MATHEMATICS

Mathematical Notes Pub Date : 2024-04-22 DOI:10.1134/s0001434624010218

E. A. Neustroeva, A. M. Raigorodskii

引用次数: 0

Abstract

We consider special distance graphs and estimate the number of edges in their subgraphs. The estimates obtained improve some known results.

Abstract Image

查看原文本刊更多论文

约翰逊图的子图中边的数量估计

摘要我们考虑了特殊的距离图，并估计了其子图中的边数。所得到的估计值改进了一些已知结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Mathematical Notes 数学-数学

CiteScore

0.90

自引率

16.70%

发文量

179

审稿时长

24 months

期刊介绍： Mathematical Notes is a journal that publishes research papers and review articles in modern algebra, geometry and number theory, functional analysis, logic, set and measure theory, topology, probability and stochastics, differential and noncommutative geometry, operator and group theory, asymptotic and approximation methods, mathematical finance, linear and nonlinear equations, ergodic and spectral theory, operator algebras, and other related theoretical fields. It also presents rigorous results in mathematical physics.