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, 1998, Volume 10, Issue 1, Pages 73–81
DOI: https://doi.org/10.4213/dm414 (Mi dm414) 		 
On the maximal $t$-packing of a complete multipartite graph

S. G. Sal'nikov
Full-text PDF (984 kB)
DOI: https://doi.org/10.4213/dm414
Abstract: We give a formula for the maximal number of vertex independent copies of a complete graph with $t$ vertices packed as subgraphs into the complete $n$-partite graph with parts of sizes $m_1,\ldots,m_n$.
Received: 01.07.1997
Bibliographic databases:
UDC: 519.14
Language: Russian
Citation: S. G. Sal'nikov, “On the maximal $t$-packing of a complete multipartite graph”, Diskr. Mat., 10:1 (1998), 73–81; Discrete Math. Appl., 8:2 (1998), 143–151
Citation in format AMSBIB
\Bibitem{Sal98}
\by S.~G.~Sal'nikov
\paper On the maximal $t$-packing of a complete multipartite graph
\jour Diskr. Mat.
\yr 1998
\vol 10
\issue 1
\pages 73--81
\mathnet{http://mi.mathnet.ru/dm414}
\crossref{https://doi.org/10.4213/dm414}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1669067}
\zmath{https://zbmath.org/?q=an:0965.05084}
\transl
\jour Discrete Math. Appl.
\yr 1998
\vol 8
\issue 2
\pages 143--151
Linking options:
  • https://www.mathnet.ru/eng/dm414
  • https://doi.org/10.4213/dm414
  • https://www.mathnet.ru/eng/dm/v10/i1/p73
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:405
    Full-text PDF :286
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024