On threshold probability for the stability of independent sets in distance graphs
From MaRDI portal
Publication:2282860
DOI10.1134/S0001434619070307zbMath1429.05190OpenAlexW2971253552MaRDI QIDQ2282860
Publication date: 20 December 2019
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434619070307
Random graphs (graph-theoretic aspects) (05C80) Extremal set theory (05D05) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
On Ramsey numbers for arbitrary sequences of graphs ⋮ On the independence number and the chromatic number of generalized preferential attachment models ⋮ 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)\) ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On random subgraphs of Kneser and Schrijver graphs
- Independence numbers of random subgraphs of a distance graph
- A simple removal lemma for large nearly-intersecting families
- On the number of edges in induced subgraphs of a special distance graph
- Independence numbers of random subgraphs of distance graphs
- A new estimate for the number of edges in induced subgraphs of a special distance graph
- Turán type results for distance graphs
- On chromatic numbers of nearly Kneser distance graphs
- 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 stability of the Erdös-Ko-Rado theorem
- On the stability of some Erdős-Ko-Rado type results
- On random subgraphs of Kneser graphs and their generalizations
- On the chromatic numbers of spheres in Euclidean spaces
- On the chromatic number of a random subgraph of the Kneser graph
- On the stability of the Erdős-Ko-Rado theorem
- Forbidding just one intersection
- On the stability of the independence number of a random subgraph
- Codes with forbidden distances
- Independence numbers of random subgraphs of some distance graph
- The number of edges in induced subgraphs of some distance graphs
- New upper bound for the chromatic number of a random subgraph of a distance graph
- On the chromatic numbers of low-dimensional spaces
- Around Borsuk's hypothesis
- Excursions into combinatorial geometry
- Borsuk's problem and the chromatic numbers of some metric spaces
- On “stability” in the Erdös--Ko--Rado Theorem
- Coloring Distance Graphs and Graphs of Diameters
- Coloring some finite sets in {R}^{n}
- TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
- The Mathematical Coloring Book
- Cliques in random graphs
- Combinatorial Geometry and Coding Theory*
- The chromatic number of random graphs
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
This page was built for publication: On threshold probability for the stability of independent sets in distance graphs
