A new estimate for the number of edges in induced subgraphs of a special distance graph
From MaRDI portal
(Redirected from Publication:327309)
Cites work
- scientific article; zbMATH DE number 6536189 (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 3577144 (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?)
- 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
- 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
(9)- On threshold probability for the stability of independent sets in distance graphs
- 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
- scientific article; zbMATH DE number 5054185 (Why is no real title available?)
- 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)