Doklady Akademii Nauk
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Doklady Akademii Nauk, 2018, Volume 478, Number 3, Pages 271–273
DOI: https://doi.org/10.7868/S0869565218030040 (Mi dan47475) 		 
This article is cited in 9 scientific papers (total in 9 papers)

On a bound in extremal combinatorics

A. M. Raigorodskiia, A. A. Sagdeevb

a Moscow Institute of Physics and Technology (State University)
b Moscow State University
Citations (9)
DOI: https://doi.org/10.7868/S0869565218030040
Abstract: A new statement of a recent theorem of [1, 2] on the maximum number of edges in a hypergraph with forbidden cardinalities of edge intersections is given. This statement is fundamentally simpler than the original one, which makes it possible to obtain important corollaries in combinatorial geometry and Ramsey theory.
English version:
Doklady Mathematics, 2018, Volume 97, Issue 1, Pages 47–48
DOI: https://doi.org/10.1134/S1064562418010155
Bibliographic databases:
Document Type: Article
UDC: 519
Language: Russian
Linking options:
  • https://www.mathnet.ru/eng/dan47475
    • This publication is cited in the following 9 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:109
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024