A new lower bound for the inducibility of a graph

Jozef Širáň

Mathematica Slovaca (1984)

  • Volume: 34, Issue: 4, page 365-370
  • ISSN: 0139-9918

How to cite

top

Širáň, Jozef. "A new lower bound for the inducibility of a graph." Mathematica Slovaca 34.4 (1984): 365-370. <http://eudml.org/doc/31750>.

@article{Širáň1984,
author = {Širáň, Jozef},
journal = {Mathematica Slovaca},
language = {eng},
number = {4},
pages = {365-370},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {A new lower bound for the inducibility of a graph},
url = {http://eudml.org/doc/31750},
volume = {34},
year = {1984},
}

TY - JOUR
AU - Širáň, Jozef
TI - A new lower bound for the inducibility of a graph
JO - Mathematica Slovaca
PY - 1984
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 34
IS - 4
SP - 365
EP - 370
LA - eng
UR - http://eudml.org/doc/31750
ER -

References

top
  1. BERGE, C, Graphs and Hypeгgгaphs, Noгth Holland, Amsterdam-London, 1973, 396-397. (1973) 
  2. HARARY F., Gгaph Theoгy, Addison-Wesley, Reading, Mass., 1969. (1969) MR0256911
  3. PIPPENGER N., GOLUMBIC M. CH., The Inducibility of a Gгaph, J. Comb. Theoгy (B)19, 1975, 189-203. (1975) MR0401552

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.