On threshold probability for the stability of independent sets in distance graphs (Q2282860): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3464534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Distance Graphs and Graphs of Diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borsuk's problem and the chromatic numbers of some metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of spheres in Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of spheres in \(\mathbb R^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring some finite sets in {R}^{n} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Around Borsuk's hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematical Coloring Book / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excursions into combinatorial geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes with forbidden distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of random subgraphs of a distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of the Erdös-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of random subgraphs of distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic numbers of nearly Kneser distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bound for the chromatic number of a random subgraph of a distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random subgraphs of Kneser and Schrijver graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a random subgraph of the Kneser graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random subgraphs of Kneser graphs and their generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of low-dimensional spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of the independence number of a random subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of some Erdős-Ko-Rado type results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Coding Theory* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidding just one intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán type results for distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edges in induced subgraphs of a special distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of edges in induced subgraphs of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new estimate for the number of edges in induced subgraphs of a special distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of random subgraphs of some distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple removal lemma for large nearly-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On “stability” in the Erdös--Ko--Rado Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques in random graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s0001434619070307 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2971253552 / rank
 
Normal rank

Latest revision as of 10:42, 30 July 2024

scientific article
Language Label Description Also known as
English
On threshold probability for the stability of independent sets in distance graphs
scientific article

    Statements

    On threshold probability for the stability of independent sets in distance graphs (English)
    0 references
    0 references
    20 December 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    random graph
    0 references
    distance graph
    0 references
    independence number
    0 references
    threshold probability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references