Combinatorial Geometry and Coding Theory*
From MaRDI portal
Publication:4976403
DOI10.3233/FI-2016-1365zbMath1421.94120MaRDI QIDQ4976403
Publication date: 28 July 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Extremal combinatorics (05D99)
Related Items (36)
Turán-type results for distance graphs in an infinitesimal plane layer ⋮ On Ramsey numbers for arbitrary sequences of graphs ⋮ Independence numbers of random subgraphs of distance graphs ⋮ Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors ⋮ Large cycles in generalized Johnson graphs ⋮ Independence numbers of random subgraphs of some distance graph ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ On a Frankl-Wilson theorem ⋮ Chromatic numbers of some distance graphs ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ A generalization of Kneser graphs ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ On the stability of the independence number of a random subgraph ⋮ On the chromatic numbers of some distance graphs ⋮ On the Frankl–Rödl theorem ⋮ On the stability of some Erdős-Ko-Rado type results ⋮ On the chromatic number of a random subgraph of the Kneser graph ⋮ On the chromatic numbers of small-dimensional Euclidean spaces ⋮ On a relation between packing and covering densities of convex bodies ⋮ Chromatic numbers of spheres ⋮ Exponentially Ramsey sets ⋮ Distance graphs with large chromatic number and without cliques of given size in the rational space ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ Bounds on Borsuk numbers in distance graphs of a special type ⋮ Chromatic numbers of Kneser-type graphs ⋮ Systems of representatives ⋮ On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ On lower bounds for the chromatic number of spheres ⋮ 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\) ⋮ Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles ⋮ The number of edges in induced subgraphs of some distance graphs ⋮ Improved Frankl-Rödl theorem and some of its geometric consequences ⋮ Clique numbers of random subgraphs of some distance graphs ⋮ Counterexamples to Borsuk's conjecture with large girth ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
This page was built for publication: Combinatorial Geometry and Coding Theory*
