The Turán problem for hypergraphs on fixed size.

Keevash, Peter

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

  • Volume: 12, Issue: 1, page Research paper N11, 6 p., electronic only-Research paper N11, 6 p., electronic only
  • ISSN: 1077-8926

How to cite

top

Keevash, Peter. "The Turán problem for hypergraphs on fixed size.." The Electronic Journal of Combinatorics [electronic only] 12.1 (2005): Research paper N11, 6 p., electronic only-Research paper N11, 6 p., electronic only. <http://eudml.org/doc/125244>.

@article{Keevash2005,
author = {Keevash, Peter},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research paper N11, 6 p., electronic only-Research paper N11, 6 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {The Turán problem for hypergraphs on fixed size.},
url = {http://eudml.org/doc/125244},
volume = {12},
year = {2005},
}

TY - JOUR
AU - Keevash, Peter
TI - The Turán problem for hypergraphs on fixed size.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2005
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 12
IS - 1
SP - Research paper N11, 6 p., electronic only
EP - Research paper N11, 6 p., electronic only
LA - eng
UR - http://eudml.org/doc/125244
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.