On the size of a maximal induced tree in a random graph

Michał Karoński; Zbigniew Palka

Mathematica Slovaca (1980)

  • Volume: 30, Issue: 2, page 151-155
  • ISSN: 0232-0525

How to cite

top

Karoński, Michał, and Palka, Zbigniew. "On the size of a maximal induced tree in a random graph." Mathematica Slovaca 30.2 (1980): 151-155. <http://eudml.org/doc/32015>.

@article{Karoński1980,
author = {Karoński, Michał, Palka, Zbigniew},
journal = {Mathematica Slovaca},
keywords = {maximal tree; random graph},
language = {eng},
number = {2},
pages = {151-155},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {On the size of a maximal induced tree in a random graph},
url = {http://eudml.org/doc/32015},
volume = {30},
year = {1980},
}

TY - JOUR
AU - Karoński, Michał
AU - Palka, Zbigniew
TI - On the size of a maximal induced tree in a random graph
JO - Mathematica Slovaca
PY - 1980
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 30
IS - 2
SP - 151
EP - 155
LA - eng
KW - maximal tree; random graph
UR - http://eudml.org/doc/32015
ER -

References

top
  1. BOLLOBÁS B., ERDÖS P., Cliques in random graphs, Math. Proc. Cambridge Philos. Soc., 80, 1976, 419-427. (1976) Zbl0344.05155MR0498256
  2. MATULA D. W., On the complete subgraphs of a random graph, Comb. Math, and Its Appl. Chapel Hill, N. C., 1970. (1970) Zbl0209.28101MR0266796
  3. MATULA D. W., The largest clique size in a random graph, Technical Report CS 7608, 1976. (1976) 

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.