Estimates of the Number of Edges in Subgraphs of Johnson Graphs
From MaRDI portal
Publication:6494808
DOI10.1134/S0001434624010218MaRDI QIDQ6494808
Unnamed Author, Andrei M. Raigorodskii
Publication date: 30 April 2024
Published in: Mathematical Notes (Search for Journal in Brave)
Cites Work
- On the chromatic numbers of spheres in Euclidean spaces
- Intersection theorems with geometric consequences
- Codes with forbidden distances
- New Turán type bounds for Johnson graphs
- Spectrum of Johnson graphs
- On the minimal number of edges in induced subgraphs of special distance graphs
- Estimate of the number of edges in special subgraphs of a distance graph
- Estimate of the number of edges in subgraphs of a Johnson graph
- The number of edges in induced subgraphs of some distance graphs
- Around Borsuk's hypothesis
- Coloring Distance Graphs and Graphs of Diameters
- Pseudorandomness
- On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$
- Computational Complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Estimates of the Number of Edges in Subgraphs of Johnson Graphs
