On Ramsey numbers for arbitrary sequences of graphs
From MaRDI portal
Publication:2145747
DOI10.1134/S1064562422010057zbMath1491.05131MaRDI QIDQ2145747
V. S. Karas', Andrei M. Raigorodskii
Publication date: 20 June 2022
Published in: Doklady Mathematics (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Unnamed Item
- On the stability of some Erdős-Ko-Rado type results
- The complete intersection theorem for systems of finite sets
- A new upper bound for diagonal Ramsey numbers
- On the stability of the independence number of a random subgraph
- The complete nontrivial-intersection theorem for systems of finite sets
- First-order complexity of subgraph isomorphism via Kneser graphs
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- Bounds on Borsuk numbers in distance graphs of a special type
- New Turán type bounds for Johnson graphs
- Estimate of the number of edges in special subgraphs of a distance graph
- A generalization of Kneser graphs
- On dividing sets into parts of smaller diameter
- Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\)
- Estimate of the number of edges in subgraphs of a Johnson graph
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- On threshold probability for the stability of independent sets in distance graphs
- Combinatorial Geometry and Coding Theory*
- All finite sets are Ramsey in the maximum norm
- Ramsey theory in the -space with Chebyshev metric
- On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$
- Embedding graphs in Euclidean space
