Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) (Q2246874): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Degree versions of theorems on intersecting families via stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of random subgraphs of a certain distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On threshold probability for the stability of independent sets in distance graphs / 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: Independence numbers of random subgraphs of distance 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 “stability” in the Erdös--Ko--Rado Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removal and Stability for Erdös--Ko--Rado / 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: Rainbow matchings in k‐partite hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey theory in the -space with Chebyshev metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Frankl-Wilson theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers corresponding to exponentially Ramsey sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak chromatic number of random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of hypergraphs with few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimate of the number of edges in special subgraphs of a distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimate of the number of edges in subgraphs of a Johnson graph / rank
 
Normal rank

Revision as of 05:47, 27 July 2024

scientific article
Language Label Description Also known as
English
Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\)
scientific article

    Statements

    Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) (English)
    0 references
    0 references
    0 references
    0 references
    16 November 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    asymptotics
    0 references
    independence number
    0 references
    random subgraphs
    0 references
    graph \(G ( n , r , < s )\)
    0 references