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


Comb. Probab. Comput., 2017, Volume 26, Issue 1, Pages 138–160 (Mi cpc1)  

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

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.


DOI: https://doi.org/10.1017/S0963548316000110


Bibliographic databases:

Received: 24.09.2014
Revised: 16.11.2015
Language:

Linking options:
  • http://mi.mathnet.ru/eng/cpc1

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Number of views:
    This page:63

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020