Estimates of the Number of Edges in Subgraphs of Johnson Graphs

DOI10.1134/S0001434624010218MaRDI QIDQ6494808zbMATH OpenFDO

Authors Andrei M. Raigorodskii

Publication date 30 April 2024

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0001434624010218

Mathematics Subject Classification ID

Distance in graphs (05C12) Enumeration in graph theory (05C30)

Cites work

• Around Borsuk's hypothesis
• Codes with forbidden distances
• Coloring distance graphs and graphs of diameters
• Computational Complexity
• 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
• scientific article; zbMATH DE number 6536189 (Why is no real title available?)
• scientific article; zbMATH DE number 3458659 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1943977 (Why is no real title available?)
• Intersection theorems with geometric consequences
• New Turán type bounds for Johnson graphs
• On the chromatic numbers of spheres in Euclidean spaces
• On the minimal number of edges in induced subgraphs of special distance graphs
• On the Ramsey numbers for complete distance graphs with vertices in \( \{0,1\}^n\)
• Pseudorandomness
• Spectrum of Johnson graphs
• The number of edges in induced subgraphs of some distance graphs
• Three lectures on the Borsuk partition problem

Cited in

(2)

• Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph
• The minimum number of cliques in induced subgraphs of Johnson graphs

This page was built for publication: Estimates of the Number of Edges in Subgraphs of Johnson Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6494808)