Sbornik: Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




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

Sbornik: Mathematics, 2012, Volume 203, Issue 10, Pages 1518–1533
DOI: https://doi.org/10.1070/SM2012v203n10ABEH004273 (Mi sm7878) 		 
Embeddings of graphs into Euclidean space under which the number of points that belong to a hyperplane is minimal

K. I. Oblakov, T. A. Oblakova

M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
English version PDF (296 kB) Russian version article
References:
PDF
HTML
DOI: https://doi.org/10.1070/SM2012v203n10ABEH004273
Abstract: The paper is devoted to the characteristic of a graph that is the minimal (over all embeddings of the graph into a space of given dimension) number of points that belong to the same hyperplane. Upper and lower estimates for this number are given that linearly depend on the dimension of the space. For trees a more precise upper estimate is obtained, which asymptotically coincides with the lower one for large dimension of the space.
Bibliography: 9 titles.
Keywords: graph, embedding, hyperplane.
Received: 14.04.2011 and 30.12.2011
Bibliographic databases:
Document Type: Article
UDC: 515.125
MSC: Primary 05C10; Secondary 57M15
Language: English
Original paper language: Russian
Citation: K. I. Oblakov, T. A. Oblakova, “Embeddings of graphs into Euclidean space under which the number of points that belong to a hyperplane is minimal”, Sb. Math., 203:10 (2012), 1518–1533
Citation in format AMSBIB
\Bibitem{OblObl12}
\by K.~I.~Oblakov, T.~A.~Oblakova
\paper Embeddings of graphs into Euclidean space under which the number of points that belong to a~hyperplane is minimal
\jour Sb. Math.
\yr 2012
\vol 203
\issue 10
\pages 1518--1533
\mathnet{http://mi.mathnet.ru//eng/sm7878}
\crossref{https://doi.org/10.1070/SM2012v203n10ABEH004273}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3027140}
\zmath{https://zbmath.org/?q=an:1258.05083}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000312249700005}
\elib{https://elibrary.ru/item.asp?id=19066348}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84872311084}
Linking options:
  • https://www.mathnet.ru/eng/sm7878
  • https://doi.org/10.1070/SM2012v203n10ABEH004273
  • https://www.mathnet.ru/eng/sm/v203/i10/p145
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математический сборник Sbornik: Mathematics
    Statistics & downloads:
    Abstract page:440
    Russian version PDF:178
    English version PDF:8
    References:60
    First page:19
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024