On threshold probability for the stability of independent sets in distance graphs

DOI10.1134/S0001434619070307MaRDI QIDQ2282860zbMATH OpenOpenAlexFDO

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

distance graph independence number random graph threshold probability

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Random graphs (graph-theoretic aspects) (05C80) Extremal set theory (05D05)

Recommendations

On the probability of independent sets in random graphs
On the stability of the independence number of a random subgraph
On stability of the independence number of a certain distance graph
Independence numbers of random subgraphs of distance graphs
On the independence number of random interval graphs
On the independent set problem in random graphs
Independence numbers of random subgraphs of a distance graph

Cites work

A new estimate for the number of edges in induced subgraphs of a special distance graph
A simple removal lemma for large nearly-intersecting families
Around Borsuk's hypothesis
Borsuk's problem and the chromatic numbers of some metric spaces
Cliques in random graphs
Codes with forbidden distances
Coloring distance graphs and graphs of diameters
Coloring some finite sets in R^n
Combinatorial geometry and coding theory
Excursions into combinatorial geometry
Forbidding just one intersection
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?)
scientific article; zbMATH DE number 1540669 (Why is no real title available?)
Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
Independence numbers of random subgraphs of a distance graph
Independence numbers of random subgraphs of distance graphs
Independence numbers of random subgraphs of some distance graph
New upper bound for the chromatic number of a random subgraph of a distance graph
On ``stability in the Erdős-Ko-Rado theorem
On chromatic numbers of nearly Kneser distance graphs
On random subgraphs of Kneser and Schrijver graphs
On random subgraphs of Kneser graphs and their generalizations
On the chromatic number of a random subgraph of the Kneser graph
On the chromatic numbers of low-dimensional spaces
On the chromatic numbers of spheres in \(\mathbb R^n\)
On the chromatic numbers of spheres in Euclidean spaces
On the number of edges in induced subgraphs of a special distance graph
On the stability of some Erdős-Ko-Rado type results
On the stability of the Erdös-Ko-Rado theorem
On the stability of the Erdős-Ko-Rado theorem
On the stability of the independence number of a random subgraph
Random graphs.
Random graphs.
The chromatic number of random graphs
The Mathematical Coloring Book
The number of edges in induced subgraphs of some distance graphs
Three lectures on the Borsuk partition problem
Transference for the Erdős-Ko-Rado theorem
Turán type results for distance 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

Cited in

(9)

Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
On Ramsey numbers for arbitrary sequences of graphs
Independence numbers of random subgraphs of some distance graph
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)\)
Independence numbers of random subgraphs of distance graphs
On the stability of some Erdős-Ko-Rado type results
Johnson graphs, their random subgraphs, and some of their extremal characteristics

This page was built for publication: On threshold probability for the stability of independent sets in distance graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2282860)