Degree powers in graphs with forbidden subgraphs.

Bollobás, Béla; Nikiforov, Vladimir

The Electronic Journal of Combinatorics [electronic only] (2004)

  • Volume: 11, Issue: 1, page Research paper R42, 8 p.-Research paper R42, 8 p.
  • ISSN: 1077-8926

How to cite

top

Bollobás, Béla, and Nikiforov, Vladimir. "Degree powers in graphs with forbidden subgraphs.." The Electronic Journal of Combinatorics [electronic only] 11.1 (2004): Research paper R42, 8 p.-Research paper R42, 8 p.. <http://eudml.org/doc/124259>.

@article{Bollobás2004,
author = {Bollobás, Béla, Nikiforov, Vladimir},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Turán graph},
language = {eng},
number = {1},
pages = {Research paper R42, 8 p.-Research paper R42, 8 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Degree powers in graphs with forbidden subgraphs.},
url = {http://eudml.org/doc/124259},
volume = {11},
year = {2004},
}

TY - JOUR
AU - Bollobás, Béla
AU - Nikiforov, Vladimir
TI - Degree powers in graphs with forbidden subgraphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2004
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 11
IS - 1
SP - Research paper R42, 8 p.
EP - Research paper R42, 8 p.
LA - eng
KW - Turán graph
UR - http://eudml.org/doc/124259
ER -

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.