Trudy po Diskretnoi Matematike
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




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

Trudy po Diskretnoi Matematike, 2000, Volume 3, Pages 29–36 (Mi tdm35)  
On the embeddability probability of a random hypergraph with coloured edges into a bipartite graph

V. A. Vatutin
Full-text PDF (356 kB)
Document Type: Article
Language: Russian
Citation: V. A. Vatutin, “On the embeddability probability of a random hypergraph with coloured edges into a bipartite graph”, Tr. Diskr. Mat., 3, Fizmatlit, Moscow, 2000, 29–36
Citation in format AMSBIB
\Bibitem{Vat00}
\by V.~A.~Vatutin
\paper On the embeddability probability of a random hypergraph with coloured edges into a bipartite graph
\serial Tr. Diskr. Mat.
\yr 2000
\vol 3
\pages 29--36
\publ Fizmatlit
\publaddr Moscow
\mathnet{http://mi.mathnet.ru/tdm35}
Linking options:
  • https://www.mathnet.ru/eng/tdm35
  • https://www.mathnet.ru/eng/tdm/v3/p29
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:202
    Full-text PDF :66
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024