scientific article; zbMATH DE number 3458659

Cited in

(33)

Diameters of random distance graphs
New Turán type bounds for Johnson 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
On threshold probability for the stability of independent sets in distance graphs
Chromatic numbers of Kneser-type graphs
Clique chromatic numbers of intersection graphs
A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
The number of edges in induced subgraphs of some distance graphs
On the chromatic number of random subgraphs of a certain distance graph
On chromatic numbers of close-to-Kneser distance graphs
On the number of edges in a uniform hypergraph with a range of permitted intersections
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
Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
scientific article; zbMATH DE number 7561729 (Why is no real title available?)
scientific article; zbMATH DE number 7250143 (Why is no real title available?)
On random subgraphs of Kneser graphs and their generalizations
scientific article; zbMATH DE number 7650110 (Why is no real title available?)
Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
Independence numbers of Johnson-type graphs
Estimates of the Number of Edges in Subgraphs of Johnson Graphs
Saturation in Kneser graphs
Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph
On two-distance (0,1)-counterexamples to Borsuk's conjecture in l_p metrics
The minimum number of cliques in induced subgraphs of Johnson graphs
Lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\)
Johnson graphs, their random subgraphs, and some of their extremal characteristics
On the ratio of Shannon numbers of graphs

This page was built for publication:

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