A note on sparse random graphs and cover graphs.
Bohmann, Tom; Frieze, Alan; Ruszinkó, Miklós; Thoma, Lubos
The Electronic Journal of Combinatorics [electronic only] (2000)
- Volume: 7, Issue: 1, page Research paper R19, 9 p.-Research paper R19, 9 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topBohmann, Tom, et al. "A note on sparse random graphs and cover graphs.." The Electronic Journal of Combinatorics [electronic only] 7.1 (2000): Research paper R19, 9 p.-Research paper R19, 9 p.. <http://eudml.org/doc/120356>.
@article{Bohmann2000,
author = {Bohmann, Tom, Frieze, Alan, Ruszinkó, Miklós, Thoma, Lubos},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {poset; cover graph; random graph},
language = {eng},
number = {1},
pages = {Research paper R19, 9 p.-Research paper R19, 9 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A note on sparse random graphs and cover graphs.},
url = {http://eudml.org/doc/120356},
volume = {7},
year = {2000},
}
TY - JOUR
AU - Bohmann, Tom
AU - Frieze, Alan
AU - Ruszinkó, Miklós
AU - Thoma, Lubos
TI - A note on sparse random graphs and cover graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2000
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 7
IS - 1
SP - Research paper R19, 9 p.
EP - Research paper R19, 9 p.
LA - eng
KW - poset; cover graph; random graph
UR - http://eudml.org/doc/120356
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.