A new estimate for the number of edges in induced subgraphs of a special distance graph
DOI10.1134/S0032946015040067zbMATH Open1347.05051OpenAlexW2963377398MaRDI QIDQ327309FDOQ327309
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
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)
Cites Work
- 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 \(\mathbb R^n\)
- The Mathematical Coloring Book
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- Three lectures on the Borsuk partition problem
- On the chromatic numbers of spheres in Euclidean spaces
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size
- Codes with forbidden distances
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$
- A new estimate for the number of edges in induced subgraphs of a special distance graph
Cited In (9)
- On threshold probability for the stability of independent sets in distance graphs
- Title not available (Why is that?)
- 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
- New Turán type bounds for Johnson graphs
- Turán-type bounds for 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
- The number of edges in induced subgraphs of some distance graphs
This page was built for publication: A new estimate for 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 Q327309)
