On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$
From MaRDI portal
Publication:5305578
DOI10.1070/SM2009v200n12ABEH004059zbMath1193.05113OpenAlexW2014407081MaRDI QIDQ5305578
Kirill Anatol'Evich Mikhaĭlov, Andrei M. Raigorodskii
Publication date: 22 March 2010
Published in: Sbornik: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/sm2009v200n12abeh004059
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (10)
Independence numbers of random subgraphs of a distance graph ⋮ On Ramsey numbers for arbitrary sequences of graphs ⋮ On the number of edges in induced subgraphs of a special distance graph ⋮ A new estimate for the number of edges in induced subgraphs of a special distance graph ⋮ Diameters of random distance graphs ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ Lower bound on the minimum number of edges in subgraphs of Johnson graphs ⋮ Estimate of the number of edges in subgraphs of a Johnson graph ⋮ New Turán type bounds for Johnson graphs ⋮ New upper bound for the chromatic number of a random subgraph of a distance graph
This page was built for publication: On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$
