On the Frankl-Rödl theorem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3131972 (Why is no real title available?)
- scientific article; zbMATH DE number 6536189 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- scientific article; zbMATH DE number 1452727 (Why is no real title available?)
- scientific article; zbMATH DE number 1406333 (Why is no real title available?)
- scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- A Partition Property of Simplices in Euclidean Space
- All Triangles are Ramsey
- All regular polytopes are Ramsey
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- Around Borsuk's hypothesis
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- Combinatorial geometry and coding theory
- Distance graphs with large chromatic number and arbitrary girth
- Forbidden Intersections
- Intersection theorems with geometric consequences
- Lower bounds for the chromatic numbers of distance graphs with large girth
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- On a bound in extremal combinatorics
- On the chromatic number of a space
- On the chromatic number of a space with a forbidden regular simplex
- On the chromatic number of a space with forbidden equilateral triangle
- On the chromatic number of an infinitesimal plane layer
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- On the number of edges in a uniform hypergraph with a range of permitted intersections
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- Permutation Groups in Euclidean Ramsey Theory
- Research Problems in Discrete Geometry
- The Mathematical Coloring Book
- The chromatic number of space with forbidden regular simplex
- The difference between consecutive primes. II
- The realization of distances within sets in Euclidean space
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
Cited in
(20)- A recursive Lovász theta number for simplex-avoiding sets
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- On a Frankl-Wilson theorem
- On a Frankl-Rödl theorem and its geometric corollaries
- Cutting corners
- On a Frankl-Wilson theorem and its geometric corollaries
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
- Counterexamples to Borsuk's conjecture with large girth
- On Frankel’s Theorem
- Improved Frankl-Rödl theorem and some of its geometric consequences
- On the chromatic number of a space with forbidden equilateral triangle
- Exponentially Ramsey sets
- On the partition of an odd number into three primes in a prescribed proportion
- Johnson graphs, their random subgraphs, and some of their extremal characteristics
- Estimate of the number of edges in special subgraphs of a distance graph
- On the chromatic numbers corresponding to exponentially Ramsey sets
- The number of edges in induced subgraphs of some distance graphs
- On the Frattinidual of Doerk and Hauck
This page was built for publication: On the Frankl-Rödl theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4613521)
