scientific article
From MaRDI portal
Publication:4044599
zbMath0293.05118MaRDI QIDQ4044599
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
On chromatic numbers of close-to-Kneser distance graphs ⋮ Independence numbers of random subgraphs of a distance graph ⋮ On the number of edges in induced subgraphs of a special distance graph ⋮ Independence numbers of random subgraphs of distance graphs ⋮ A new estimate for the number of edges in induced subgraphs of a special distance graph ⋮ An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy ⋮ On the number of edges in a uniform hypergraph with a range of permitted intersections ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ Diameters of random distance graphs ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Chromatic numbers of some distance graphs ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ Independence numbers of Johnson-type graphs ⋮ Unnamed Item ⋮ On random subgraphs of Kneser graphs and their generalizations ⋮ On the chromatic numbers of small-dimensional Euclidean spaces ⋮ Unnamed Item ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ Chromatic numbers of Kneser-type graphs ⋮ Unnamed Item ⋮ Clique chromatic numbers of intersection graphs ⋮ A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) ⋮ The number of edges in induced subgraphs of some distance graphs ⋮ New Turán type bounds for Johnson graphs ⋮ On the chromatic number of random subgraphs of a certain distance graph ⋮ Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs
This page was built for publication:
