A generalization of a theorem of Turán for valuated graphs

Jaroslav Morávek

Časopis pro pěstování matematiky (1974)

  • Volume: 099, Issue: 3, page 286-292
  • ISSN: 0528-2195

How to cite

top

Morávek, Jaroslav. "A generalization of a theorem of Turán for valuated graphs." Časopis pro pěstování matematiky 099.3 (1974): 286-292. <http://eudml.org/doc/21212>.

@article{Morávek1974,
author = {Morávek, Jaroslav},
journal = {Časopis pro pěstování matematiky},
language = {eng},
number = {3},
pages = {286-292},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {A generalization of a theorem of Turán for valuated graphs},
url = {http://eudml.org/doc/21212},
volume = {099},
year = {1974},
}

TY - JOUR
AU - Morávek, Jaroslav
TI - A generalization of a theorem of Turán for valuated graphs
JO - Časopis pro pěstování matematiky
PY - 1974
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 099
IS - 3
SP - 286
EP - 292
LA - eng
UR - http://eudml.org/doc/21212
ER -

References

top
  1. Berge, C, Graphеs еt hypеrgraphеs, Paris, DUNOD, 1970. (1970) 
  2. Turán P., An еxtrеmal problеm in graph thеory, (Hungarian). Mat. Fiz. Lapok, 48, 1941, 436-452. (1941) 
  3. Motzkin T. S., E. G. Straus, Maxima of Graphs and a Nеw Proof of a Thеorеm of Turán, Canadian Journal of Mathеmatiсs, Vol. XVII, pp. 533-540. MR0175813
  4. Simonovits M., A Mеthod for Solving Extrеmal Problеms in Graph Thеoгy, Stability Pгoblеms. Proсееdings of thе Colloquium hеld at Tihány, 279-319, Akad. Kiadó, Buda- pеst, 1968. (1968) MR0233735
  5. Sauer N., A Gеnеralization of a Thеorеm of Turán, Journal of Combinatorial Thеory 10, 109-112, 1971. (1971) MR0289348
  6. Erdös P., On somе inеqualitiеs сonсеrning еxtrеmal propеrtiеs of graphs, Thеory of Graphs, Proс. Coll. hеld at Tihány, Hungary, 1966. (1966) 
  7. Sós V. T, On еxtrеmal problеms in graph thеory, Combinatorial Struсturеs and Thеir Appliсations, Proсееdings, Calgary, Junе 1969. (1969) 
  8. Reid K. B., Two appliсations of Turán's thеorеm to asymmеtriс digraphs, Combinatorial Struсturеs and Thеir Appliсations, Proсееdings, Calgary, Junе 1969. (1969) 
  9. Novák J., Eulеrovské grafy bеz tгojúhеlníků s maximálním počtеm hгan, Sborník vědесkýсh praсí VŠST, Libеrес 1972, 29-35. (1972) 
  10. Morávek J., On thе dеgrееs of graphs with α ( G ) ≤ 2 , Časopis pro pёstování matеmatiky, (to appеaг). 
  11. Hardy G. H., J. E. Littlewood G. Polya, Inеqualitiеs, Cambridgе Univеrsity Prеss, 1934. (1934) 
  12. Bellman R. E., Dynamiс Pгogгamming, Prinсеton Univ. Prеss, Prinсеton, N. Ј. 1957. (1957) 

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.