Independence numbers of random subgraphs of a distance graph
From MaRDI portal
Publication:296011
DOI10.1134/S000143461601034XzbMATH Open1338.05069OpenAlexW4253400666MaRDI QIDQ296011FDOQ296011
Authors: M. M. Pyaderkin
Publication date: 14 June 2016
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s000143461601034x
Recommendations
- Independence numbers of random subgraphs of distance graphs
- Independence numbers of random subgraphs of some distance graph
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- On the independence number of random graphs
- scientific article; zbMATH DE number 1507217
- On the independence number of random interval graphs
- On the independence ratio of distance graphs
- On the stability of the independence number of a random subgraph
- The independent domination number of random graph
Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Excursions into combinatorial geometry
- Random graphs.
- 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?)
- Codes with forbidden distances
- Random graphs.
- 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\)
Cited In (18)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
- On stability of the independence number of a certain distance graph
- Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\)
- On threshold probability for the stability of independent sets in distance graphs
- On the chromatic number of random subgraphs of a certain distance graph
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
- Independence numbers of random subgraphs of distance graphs
- On the chromatic numbers of low-dimensional spaces
- On the stability of the independence number of a random subgraph
- Sharp bounds for the chromatic number of random Kneser graphs
- Independence numbers of random subgraphs of some distance graph
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- On random subgraphs of Kneser graphs and their generalizations
- Independence numbers of Johnson-type 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
- Clique numbers of random subgraphs of some distance graphs
- The number of edges in induced subgraphs of some distance graphs
This page was built for publication: Independence numbers of random subgraphs of a distance graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296011)