On the number of edges in induced subgraphs of a special distance graph
From MaRDI portal
Publication:325666
DOI10.1134/S0001434616030275zbMATH Open1347.05050MaRDI QIDQ325666FDOQ325666
Authors: F. A. Pushnyakov 
Publication date: 18 October 2016
Published in: Mathematical Notes (Search for Journal in Brave)
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
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)
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?)
- 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 with large chromatic numbers and small clique numbers
- 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\)
- Title not available (Why is that?)
Cited In (6)
- On threshold probability for the stability of independent sets in distance graphs
- Title not available (Why is that?)
- 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
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)
