On Ramsey numbers for arbitrary sequences of graphs (Q2145747): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for diagonal Ramsey numbers / 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: All finite sets are Ramsey in the maximum norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding graphs in Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Coding Theory* / 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
Property / cites work
 
Property / cites work: On dividing sets into parts of smaller diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic numbers of distance graphs without short odd cycles in rational spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Borsuk numbers in distance graphs of a special type / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order complexity of subgraph isomorphism via Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complete nontrivial-intersection theorem for systems of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complete intersection theorem for systems of finite sets / 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: New Turán type bounds for Johnson graphs / 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: On the stability of some Erdős-Ko-Rado type results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability versions of Erdős-Ko-Rado type theorems via isoperimetry / rank
 
Normal rank

Latest revision as of 08:48, 29 July 2024

scientific article
Language Label Description Also known as
English
On Ramsey numbers for arbitrary sequences of graphs
scientific article

    Statements

    On Ramsey numbers for arbitrary sequences of graphs (English)
    0 references
    0 references
    0 references
    20 June 2022
    0 references
    Ramsey numbers
    0 references
    independence numbers
    0 references
    stability
    0 references
    random graphs
    0 references
    0 references
    0 references

    Identifiers