Combinatorics, Probability and Computing
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
Main page
About this project
Software
Classifications
Links
Terms of Use

Search papers
Search references

RSS
Current issues
Archive issues
What is RSS






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


Combinatorics, Probability and Computing, 2017, Volume 26, Issue 1, Pages 138–160
DOI: https://doi.org/10.1017/S0963548316000110
(Mi cpc1)
 

This article is cited in 18 scientific papers (total in 18 papers)

Asymptotic structure of graphs with the minimum number of triangles

Oleg Pikhurkoa, Alexander Razborovbc

a Mathematics Institute and DIMAP, University of Warwick, Coventry CV4 7AL, UK
b Department of Computer Science, University of Chicago, Chicago, IL 60637, USA
c Steklov Mathematical Institute
Citations (18)
Funding agency Grant number
European Research Council 306493
Engineering and Physical Sciences Research Council EP/K012045/1
Russian Foundation for Basic Research
Toyota Technological Institute, Chicago
Supported by ERC grant 306493 and EPSRC grant EP/K012045/1. Part of this work was done while the author was at Steklov Mathematical Institute, supported by the Russian Foundation for Basic Research, and at Toyota Technological Institute, Chicago.
Received: 24.09.2014
Revised: 16.11.2015
Bibliographic databases:
Document Type: Article
Language: English
Linking options:
  • https://www.mathnet.ru/eng/cpc1
  • This publication is cited in the following 18 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024