On the number of edges in induced subgraphs of a special distance graph

DOI10.1134/S0001434616030275MaRDI QIDQ325666zbMATH OpenFDO

Authors F. A. Pushnyakov

Publication date 18 October 2016

Published in Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

cliquecyclecoloringdistance graphBorsuk problem

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

• 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
• 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
• On the number of distinct induced subgraphs of a graph
• scientific article; zbMATH DE number 5054185
• On the number of certain subgraphs contained in graphs with a given number of edges
• Note on induced subgraphs of the unit distance graph \(E^ n\)
• Edge-disjoint induced subgraphs with given minimum degree
• On subgraphs in distance-regular graphs

Cites work

• scientific article; zbMATH DE number 6536189 (Why is no real title available?)
• scientific article; zbMATH DE number 3700716 (Why is no real title available?)
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 51916 (Why is no real title available?)
• scientific article; zbMATH DE number 3458659 (Why is no real title available?)
• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• scientific article; zbMATH DE number 1943977 (Why is no real title available?)
• Around Borsuk's hypothesis
• Borsuk's problem and the chromatic numbers of some metric spaces
• Codes with forbidden distances
• Coloring distance graphs and graphs of diameters
• Coloring some finite sets in \(\mathbb R^n\)
• Excursions into combinatorial geometry
• Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
• On the Ramsey numbers for complete distance graphs with vertices in \( \{0,1\}^n\)
• On the chromatic numbers of spheres in Euclidean spaces
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• The Mathematical Coloring Book
• Three lectures on the Borsuk partition problem

Cited in

(6)

• On threshold probability for the stability of independent sets in distance 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
• On the chromatic number of a random subgraph of the Kneser graph
• The number of edges in induced subgraphs of some distance graphs
• scientific article; zbMATH DE number 5054185 (Why is no real title available?)

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

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