Geodesic
On the embeddability probability of a random hypergraph with coloured edges into a bipartite graph
Trudy po diskretnoj matematike, Trudy po Diskretnoi Matematike, Tome 3 (2000), pp. 29-36
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

@article{TDM_2000_3_a2,
     author = {V. A. Vatutin},
     title = {On the embeddability probability of a random hypergraph with coloured edges into a bipartite graph},
     journal = {Trudy po diskretnoj matematike},
     pages = {29--36},
     year = {2000},
     volume = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TDM_2000_3_a2/}
}
TY  - JOUR
AU  - V. A. Vatutin
TI  - On the embeddability probability of a random hypergraph with coloured edges into a bipartite graph
JO  - Trudy po diskretnoj matematike
PY  - 2000
SP  - 29
EP  - 36
VL  - 3
UR  - http://geodesic.mathdoc.fr/item/TDM_2000_3_a2/
LA  - ru
ID  - TDM_2000_3_a2
ER  - 
%0 Journal Article
%A V. A. Vatutin
%T On the embeddability probability of a random hypergraph with coloured edges into a bipartite graph
%J Trudy po diskretnoj matematike
%D 2000
%P 29-36
%V 3
%U http://geodesic.mathdoc.fr/item/TDM_2000_3_a2/
%G ru
%F TDM_2000_3_a2
V. A. Vatutin. On the embeddability probability of a random hypergraph with coloured edges into a bipartite graph. Trudy po diskretnoj matematike, Trudy po Diskretnoi Matematike, Tome 3 (2000), pp. 29-36. http://geodesic.mathdoc.fr/item/TDM_2000_3_a2/