On the number of edges in induced subgraphs of a special distance graph
From MaRDI portal
Publication:325666
DOI10.1134/S0001434616030275zbMath1347.05050MaRDI QIDQ325666
Publication date: 18 October 2016
Published in: Mathematical Notes (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
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, On threshold probability for the stability of independent sets in distance graphs, The number of edges in induced subgraphs of some distance graphs
Cites Work
- 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
