Combinatorial geometry and coding theory
From MaRDI portal
Publication:4976403
DOI10.3233/FI-2016-1365zbMATH Open1421.94120MaRDI QIDQ4976403FDOQ4976403
Authors: Andrei M. Raigorodskii 
Publication date: 28 July 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Recommendations
- On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems
- On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem
- Topics in modern combinatorics. 23rd Brazilian mathematics colloquium.
- Borsuk's problem and the chromatic numbers of metric spaces
- scientific article
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Extremal combinatorics (05D99)
Cited In (40)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
- On the stability of some Erdős-Ko-Rado type results
- Topics in modern combinatorics. 23rd Brazilian mathematics colloquium.
- On the Frankl-Rödl theorem
- 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
- Large cycles in generalized Johnson graphs
- On a Frankl-Wilson theorem
- Partitions in finite geometry and related constant composition codes
- Independence numbers of random subgraphs of distance graphs
- On a relation between packing and covering densities of convex bodies
- On a Frankl-Wilson theorem and its geometric corollaries
- A generalization of Kneser graphs
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- On Ramsey numbers for arbitrary sequences of graphs
- Distance graphs with large chromatic number and without cliques of given size in the rational space
- Chromatic numbers of spheres
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- Systems of representatives
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- Bounds on Borsuk numbers in distance graphs of a special type
- Counterexamples to Borsuk's conjecture with large girth
- On the stability of the independence number of a random subgraph
- Improved Frankl-Rödl theorem and some of its geometric consequences
- Appendix: Solution of Burnashev’s Problem and a Sharpening of the Erdős/Ko/Rado Theorem
- On the chromatic numbers of small-dimensional Euclidean spaces
- Independence numbers of random subgraphs of some distance graph
- Turán-type results for distance graphs in an infinitesimal plane layer
- On lower bounds for the chromatic number of spheres
- Exponentially Ramsey sets
- Clique chromatic numbers of intersection graphs
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- On the chromatic numbers of some distance graphs
- Estimate of the number of edges in special subgraphs of a distance graph
- On the chromatic number of a random subgraph of the Kneser graph
- On the chromatic numbers corresponding to exponentially Ramsey sets
- Clique numbers of random subgraphs of some distance graphs
- The number of edges in induced subgraphs of some distance graphs
- Chromatic numbers of some distance graphs
This page was built for publication: Combinatorial geometry and coding theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976403)
