scientific article; zbMATH DE number 3458659
From MaRDI portal
Publication:4044599
zbMATH Open0293.05118MaRDI QIDQ4044599FDOQ4044599
Authors: Zsigmond Nagy 
Publication date: 1974
Title of this publication is not available (Why is that?)
Cited In (29)
- On chromatic numbers of close-to-Kneser distance graphs
- Title not available (Why is that?)
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- Chromatic numbers of Kneser-type graphs
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- On threshold probability for the stability of independent sets in distance graphs
- On the chromatic number of random subgraphs of a certain distance graph
- Title not available (Why is that?)
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
- Title not available (Why is that?)
- Diameters of random distance graphs
- Independence numbers of random subgraphs of a distance graph
- Independence numbers of random subgraphs of distance graphs
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
- 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
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
- New Turán type bounds for Johnson graphs
- Saturation in Kneser graphs
- Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph
- On the chromatic numbers of small-dimensional Euclidean spaces
- Estimates of the Number of Edges in Subgraphs of Johnson Graphs
- Clique chromatic numbers of intersection graphs
- On random subgraphs of Kneser graphs and their generalizations
- Independence numbers of Johnson-type graphs
- Estimate of the number of edges in special subgraphs of a distance graph
- The number of edges in induced subgraphs of some distance graphs
- Chromatic numbers of some distance 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)
