Combinatorial geometry and coding theory
From MaRDI portal
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; zbMATH DE number 6381834
Cited in
(40)- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- On the stability of the independence number of a random subgraph
- On the chromatic numbers of some distance graphs
- Chromatic numbers of spheres
- On a relation between packing and covering densities of convex bodies
- Bounds on Borsuk numbers in distance graphs of a special type
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
- On Ramsey numbers for arbitrary sequences of 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
- 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
- Chromatic numbers of Kneser-type graphs
- 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 _1 and _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
- Turán-type results for distance graphs in an infinitesimal plane layer
- Topics in modern combinatorics. 23rd Brazilian mathematics colloquium.
- Independence numbers of random subgraphs of distance graphs
- Greedy and heuristic algorithms for codes and colorings
- On the Frankl-Rödl theorem
- On the stability of some Erdős-Ko-Rado type results
- Appendix: Solution of Burnashev’s Problem and a Sharpening of the Erdős/Ko/Rado Theorem
- Systems of representatives
- Large cycles in generalized Johnson graphs
- On a Frankl-Wilson theorem and its geometric corollaries
- On the chromatic number of a random subgraph of the Kneser graph
- Partitions in finite geometry and related constant composition codes
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)
