New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
From MaRDI portal
Publication:2262987
DOI10.1134/S0032946013040091zbMath1308.05083MaRDI QIDQ2262987
E. I. Ponomarenko, Andrei M. Raigorodskii
Publication date: 17 March 2015
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items
On chromatic numbers of close-to-Kneser distance graphs, On a bound in extremal combinatorics, On the chromatic numbers of rational spaces, Independence numbers and chromatic numbers of the random subgraphs of some distance graphs, On the maximal number of edges in a uniform hypergraph with one forbidden intersection, On lower bounds for the chromatic number of sphere, On the number of edges of a uniform hypergraph with a range of allowed intersections, On a Frankl-Wilson theorem, On the Frankl–Rödl theorem, 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, On the stability of the Erdös-Ko-Rado theorem, Exponentially Ramsey sets, Hamiltonian paths in distance graphs, On lower bounds for the chromatic number of spheres, Improved Frankl-Rödl theorem and some of its geometric consequences, New upper bound for the chromatic number of a random subgraph of a distance graph
Cites Work
- Unnamed Item
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- On the chromatic numbers of spheres in Euclidean spaces
- Counterexamples to Borsuk's conjecture on spheres of small radius
- The complete intersection theorem for systems of finite sets
- Intersection theorems with geometric consequences
- The complete nontrivial-intersection theorem for systems of finite sets
- Codes with forbidden distances
- Coloring Distance Graphs and Graphs of Diameters
- A counterexample to Borsuk’s conjecture
- On the chromatic number of a space
- The realization of distances within sets in Euclidean space
