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

DOI10.1134/S0001434622050303MaRDI QIDQ2150630zbMATH OpenOpenAlexFDO

Authors 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

distance graphsJohnson graphs

Mathematics Subject Classification ID

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

Recommendations

• On the number of edges in induced subgraphs of a special distance graph
• The number of edges in induced subgraphs of some distance graphs
• A new estimate for the number of edges in induced subgraphs of a special distance graph
• Estimate of the number of edges in special subgraphs of a distance graph
• Edge-disjoint induced subgraphs with given minimum degree
• scientific article; zbMATH DE number 5054185
• On the number of distinct induced subgraphs of a graph
• scientific article; zbMATH DE number 867705
• On the independence number of minimum distance graphs
• Special edges, and approximating the smallest directed k-edge connected spanning subgraph

Cites work

• A generalization of Kneser graphs
• A new estimate for the number of edges in induced subgraphs of a special distance graph
• Around Borsuk's hypothesis
• Borsuk's problem and the chromatic numbers of some metric spaces
• Bounds on Borsuk numbers in distance graphs of a special type
• 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
• Excursions into combinatorial geometry
• Forbidding just one intersection
• scientific article; zbMATH DE number 6536189 (Why is no real title available?)
• Intersection theorems with geometric consequences
• On stability of the independence number of a certain distance graph
• On the number of edges in induced subgraphs of a special distance graph
• The number of edges in induced subgraphs of some distance graphs
• Turán type results for distance graphs
• Turán-type results for distance graphs in an infinitesimal plane layer

Cited in

(7)

• On the number of edges in induced subgraphs of a special distance graph
• scientific article; zbMATH DE number 5054185 (Why is no real title available?)
• Lower bound on the minimum number of edges in subgraphs of Johnson graphs
• Estimates of the Number of Edges in Subgraphs of Johnson Graphs
• 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
• Stability of the independence number of G(n,r,1) graphs

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

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