scientific article; zbMATH DE number 2196516
From MaRDI portal
Publication:5465363
zbMath1074.05088MaRDI QIDQ5465363
Publication date: 22 August 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Ramsey theory (05D10)
Related Items (13)
From Affine to Two-Source Extractors via Approximate Duality ⋮ A bipartite analogue of Dilworth's theorem ⋮ 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction ⋮ New MRD codes from linear cutting blocking sets ⋮ Evasive subspaces, generalized rank weights and near MRD codes ⋮ On rigid matrices and \(U\)-polynomials ⋮ Lossless dimension expanders via linearized polynomials and subspace designs ⋮ On set intersection representations of graphs ⋮ Unnamed Item ⋮ Explicit two-source extractors and resilient functions ⋮ Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs ⋮ Crossing patterns of semi-algebraic sets ⋮ Unnamed Item
This page was built for publication:
