On a bound in extremal combinatorics
From MaRDI portal
Recommendations
- Recent developments in extremal combinatorics: Ramsey and Turán type problems
- Large cliques in hypergraphs with forbidden substructures
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
- Improvements of the Frankl-Rödl theorem and geometric consequences
- Extremal problems for geometric hypergraphs
Cites work
- Improvements of the Frankl-Rödl theorem and geometric consequences
- Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle
- Intersection theorems with geometric consequences
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- New lower bound for the chromatic number of a rational space with one and two forbidden distances
- On lower bounds for the chromatic number of sphere
- On random subgraphs of Kneser and Schrijver graphs
- On the chromatic number of a space
- On the chromatic numbers of low-dimensional spaces
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- The realization of distances within sets in Euclidean space
Cited in
(20)- On the chromatic numbers of some distance graphs
- Refuting conjectures in extremal combinatorics via linear programming
- Bounds on Borsuk numbers in distance graphs of a special type
- On a Frankl-Wilson theorem
- 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
- Equitable colorings of hypergraphs with few edges
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- Improved Frankl-Rödl theorem and some of its geometric consequences
- Recent developments in extremal combinatorics: Ramsey and Turán type problems
- On the Frankl-Rödl theorem
- On the Horton-Strahler Number for Combinatorial Tries
- Preface: Levon Khachatrian's legacy in extremal combinatorics
- On a Frankl-Wilson theorem and its geometric corollaries
- Cutting corners
- Johnson graphs, their random subgraphs, and some of their extremal characteristics
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
This page was built for publication: On a bound in extremal combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1643771)
