On Ramsey numbers for arbitrary sequences of graphs

DOI10.1134/S1064562422010057MaRDI QIDQ2145747zbMATH OpenFDO

Authors V. S. Karas', Andrei M. Raigorodskii

Publication date 20 June 2022

Published in Doklady Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1134/S1064562422010057

zbMATH Keywords

independence numbersRamsey numbersrandom graphsstability

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Random graphs (graph-theoretic aspects) (05C80) Ramsey theory (05D10)

Recommendations

• Computation of some generalized Ramsey numbers
• Ramsey sequences of graphs
• Generalized Ramsey theory for multiple colors
• The size Ramsey number
• What can we hope to accomplish in generalized Ramsey theory ?

Cites work

• A generalization of Kneser graphs
• A new upper bound for diagonal Ramsey numbers
• All finite sets are Ramsey in the maximum norm
• Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\)
• Bounds on Borsuk numbers in distance graphs of a special type
• Chromatic numbers of distance graphs without short odd cycles in rational spaces
• Combinatorial geometry and coding theory
• Embedding graphs in Euclidean space
• Estimate of the number of edges in special subgraphs of a distance graph
• Estimate of the number of edges in subgraphs of a Johnson graph
• First-order complexity of subgraph isomorphism via Kneser graphs
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• New Turán type bounds for Johnson graphs
• On dividing sets into parts of smaller diameter
• On the Ramsey numbers for complete distance graphs with vertices in \( \{0,1\}^n\)
• On the stability of some Erdős-Ko-Rado type results
• On the stability of the independence number of a random subgraph
• On threshold probability for the stability of independent sets in distance graphs
• Ramsey theory in the \(n\)-space with Chebyshev metric
• Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
• The complete intersection theorem for systems of finite sets
• The complete nontrivial-intersection theorem for systems of finite sets

Cited in

(7)

• The Ramsey property for collections of sequences not containing all arithmetic progressions
• Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings
• Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples
• scientific article; zbMATH DE number 4110731 (Why is no real title available?)
• Ramsey sequences of graphs
• List Ramsey numbers
• Johnson graphs, their random subgraphs, and some of their extremal characteristics

This page was built for publication: On Ramsey numbers for arbitrary sequences of graphs

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