New estimates in the problem of the number of edges in a hypergraph with forbidden intersections-Reference-Cited by-同舟云学术

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

Published:2013-10 Issue:4 Volume:49 Page:384-390
ISSN:0032-9460
Container-title:Problems of Information Transmission
language:en
Short-container-title:Probl Inf Transm

Author:

Ponomarenko E. I.,Raigorodskii A. M.

Publisher

Pleiades Publishing Ltd

Subject

Computer Networks and Communications,Computer Science Applications,Information Systems

Link

http://link.springer.com/content/pdf/10.1134/S0032946013040091.pdf

Reference18 articles.

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 Zémor, 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 [Russian Math. Surveys (Engl. Transl.), 2001, vol. 56, no. 1, pp. 103–139].

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Frankl–Rödl theorem;Izvestiya: Mathematics;2018-12

2. Improved Frankl–Rödl Theorem and Some of Its Geometric Consequences;Problems of Information Transmission;2018-04

3. On a Bound in Extremal Combinatorics;Doklady Mathematics;2018-01

4. On the Chromatic Numbers of Rational Spaces;Mathematical Notes;2018-01

5. On the Number of Edges of a Uniform Hypergraph with a Range of Allowed Intersections;Problems of Information Transmission;2017-06-25