A new estimate for the number of edges in induced subgraphs of a special distance graph
From MaRDI portal
Publication:327309
DOI10.1134/S0032946015040067zbMath1347.05051OpenAlexW2963377398MaRDI QIDQ327309
Publication date: 19 October 2016
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946015040067
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (7)
On the minimal number of edges in induced subgraphs of special distance graphs ⋮ A new estimate for the number of edges in induced subgraphs of a special distance graph ⋮ Turán-type bounds for distance graphs ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ The number of edges in induced subgraphs of some distance graphs ⋮ New Turán type bounds for Johnson graphs
Cites Work
- A new estimate for the number of edges in induced subgraphs of a special distance graph
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
- On the chromatic numbers of spheres in Euclidean spaces
- Distance graphs with large chromatic numbers and small clique numbers
- Codes with forbidden distances
- Around Borsuk's hypothesis
- Excursions into combinatorial geometry
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring Distance Graphs and Graphs of Diameters
- Coloring some finite sets in {R}^{n}
- The Mathematical Coloring Book
- On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new estimate for the number of edges in induced subgraphs of a special distance graph
