Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2011, Volume 23, Issue 3, Pages 57–62
DOI: https://doi.org/10.4213/dm1152 (Mi dm1152) 		 
This article is cited in 2 scientific papers (total in 2 papers)

On estimation of the number of graphs in some hereditary classes

V. A. Zamaraev
Full-text PDF (101 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1152
Abstract: We consider the classes in the zero layer of the set of infinite hereditary classes of graphs defined by two forbidden subgraphs. One of these subgraphs is $K_{1,s}+O_p$ and the other is $K_q$. We give an upper bound for the number of graphs in these classes.
Received: 23.12.2009
English version:
Discrete Mathematics and Applications, 2011, Volume 21, Issue 4, Pages 435–441
DOI: https://doi.org/10.1515/DMA.2011.027
Bibliographic databases:
Document Type: Article
UDC: 519.1
Language: Russian
Citation: V. A. Zamaraev, “On estimation of the number of graphs in some hereditary classes”, Diskr. Mat., 23:3 (2011), 57–62; Discrete Math. Appl., 21:4 (2011), 435–441
Citation in format AMSBIB
\Bibitem{Zam11}
\by V.~A.~Zamaraev
\paper On estimation of the number of graphs in some hereditary classes
\jour Diskr. Mat.
\yr 2011
\vol 23
\issue 3
\pages 57--62
\mathnet{http://mi.mathnet.ru/dm1152}
\crossref{https://doi.org/10.4213/dm1152}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2895514}
\elib{https://elibrary.ru/item.asp?id=20730395}
\transl
\jour Discrete Math. Appl.
\yr 2011
\vol 21
\issue 4
\pages 435--441
\crossref{https://doi.org/10.1515/DMA.2011.027}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-81555215542}
Linking options:
  • https://www.mathnet.ru/eng/dm1152
  • https://doi.org/10.4213/dm1152
  • https://www.mathnet.ru/eng/dm/v23/i3/p57
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:777
    Full-text PDF :276
    References:91
    First page:33
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024