On the minimal number of edges in induced subgraphs of special distance graphs

DOI10.1134/S0001434622050303zbMath1492.05069OpenAlexW4283383635MaRDI QIDQ2150630

Ya. K. Shubin

Publication date: 30 June 2022

Published in: Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

Johnson graphsdistance graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Lower bound on the minimum number of edges in subgraphs of Johnson graphs

Cites Work

• Unnamed Item
• On the number of edges in induced subgraphs of a special distance graph
• A new estimate for the number of edges in induced subgraphs of a special distance graph
• Turán type results for distance graphs
• Forbidding just one intersection
• Intersection theorems with geometric consequences
• Bounds on Borsuk numbers in distance graphs of a special type
• Estimate of the number of edges in special subgraphs of a distance graph
• A generalization of Kneser graphs
• On stability of the independence number of a certain 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
• Excursions into combinatorial geometry
• Turán-type results for distance graphs in an infinitesimal plane layer
• Borsuk's problem and the chromatic numbers of some metric spaces

This page was built for publication: On the minimal number of edges in induced subgraphs of special distance graphs