New estimates in the problem of the number of edges in a hypergraph with forbidden intersections

Problems of Information Transmission

Volumn 49, Issue 4, 2013, Pages 384-390

  Ponomarenko, E I ^a   Raigorodskii, A M ^a,b  

^a MOSCOW INSTITUTE OF PHYSICS AND TECHNOLOGY   (Russian Federation)

^b MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

CARDINALITIES; HYPERGRAPH; UPPER BOUND;

COMPUTER NETWORKS;

EID: 84897971375     PISSN: 00329460     EISSN: 16083253     Source Type: Journal    
DOI: 10.1134/S0032946013040091     Document Type: Article

References (25)

1. Frankl, P. and Wilson, R., Intersection Theorems with Geometric Consequences, Combinatorica, 1981, vol. 1, no. 4, pp. 357-368.
2. Raigorodskii, A.M., Lineino-algebraicheskii metod v kombinatorike (Linear-Algebraic Method in Combinatorics), Moscow: MCCME, 2007.
3. Babai, L. and Frankl, P., Linear Algebra Methods in Combinatorics with Applications to Geometry and Computer Science, Preliminary version 2, Part 1, Department of Computer Science, Univ. of Chicago, 1992.
4. Bassalygo, L., Cohen, G., and Źemor, G., Codes with Forbidden Distances, Discrete Math., 2000, vol. 213, no. 1-3, pp. 3-11.
5. Raigorodskii, A.M., The Borsuk Problem and the Chromatic Numbers of Some Metric Spaces, Uspekhi Mat. Nauk, 2001, vol. 56, no. 1, pp. 107-146
6. [Russian Math. Surveys (Engl. Transl.), 2001, vol. 56, no. 1, pp. 103-139].
7. Raigorodskii, A.M., On the Chromatic Numbers of Spheres in Euclidean Spaces, Dokl. Akad. Nauk, 2010, vol. 432, no. 2, pp. 174-177
8. [Dokl. Math. (Engl. Transl.), 2010, vol. 81, no. 3, pp. 379-382].
9. n, Combinbatorica, 2012, vol. 32, no. 1, pp. 111-123.
10. Kahn, J. and Kalai, G., A Counterexample to Borsuk's Conjecture, Bull. Amer.Math. Soc. (N.S.), 1993, vol. 29, no. 1, pp. 60-62.
11. Raigorodskii, A.M., Three Lectures on the Borsuk Partition Problem, Surveys in Contemporary Mathematics, Young, N. and Choi, Y., Eds., London Math. Soc. Lect. Note Ser., vol. 347. Cambridge: Cambridge Univ. Press, 2007, pp. 202-248.
12. Raigorodskii, A.M., Around the Borsuk Conjecture, Sovrem. Mat. Fundam. Napravl., 2007, vol. 23, pp. 147-164
13. [J. Math. Sci. (N.Y.) (Engl. Transl.), 2007, vol. 154, no. 4, pp. 604-623].
14. Raigorodskii, A.M., Coloring Distance Graphs and Graphs of Diameters, Thirty Essays on Geometric Graph Theory, Pach, J., Ed., Berlin: Springer, 2013, pp. 429-460.
15. Raigorodskii, A.M., Counterexamples to Borsuk's Conjecture on Spheres of Small Radius, Dokl. Akad. Nauk, 2010, vol. 434, no. 2, pp. 161-163
16. [Dokl. Math. (Engl. Transl.), 2010, vol. 82, no. 2, pp. 719-721].
17. Raigorodskii, A.M., On Dimensionality in the Borsuk Problem, Uspekhi Mat. Nauk, 1997, vol. 52, no. 6, pp. 181-182
18. [Russian Math. Surveys (Engl. Transl.), 1997, vol. 52, no. 6, pp. 1324-1325].
19. Raigorodskii, A.M., On a Bound in the Borsuk Problem, Uspekhi Mat. Nauk, 1999, vol. 54, no. 2, pp. 185-186
20. [Russian Math. Surveys (Engl. Transl.), 1999, vol. 54, no. 2, pp. 453-454].
21. Raigorodskii, A.M., On the Chromatic Number of a Space, Uspekhi Mat. Nauk, 2000, vol. 55, no. 2, pp. 147-148
22. [Russian Math. Surveys (Engl. Transl.), 2000, vol. 55, no. 2, pp. 351-352].
23. Larman, D.G. and Rogers, C.A., The Realization of Distances within Sets in Euclidean Space, Mathematika, 1972, vol. 19, no. 1, pp. 1-24.
24. Ahlswede, R. and Khachatrian, L.H., The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets, J. Combin. Theory, Ser. A, 1996, vol. 76, no. 1, pp. 121-138. (Pubitemid 126168126)
25. Ahlswede, R. and Khachatrian, L.H., The Complete Intersection Theorem for Systems of Finite Sets, European J. Combin., 1997, vol. 18, no. 2, pp. 125-136.