Extremal problems for $t$-partite and $t$-colorable hypergraphs.

Mubayi, Dhruv, and Talbot, John. "Extremal problems for -partite and -colorable hypergraphs.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper R26, 9 p.-Research Paper R26, 9 p.. <http://eudml.org/doc/117222>.

@article{Mubayi2008,
author = {Mubayi, Dhruv, Talbot, John},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {maximumm number of edges; r-uniform hypergraph; t-chromatic hypergraph; Lagrangian of a hypergraph},
language = {eng},
number = {1},
pages = {Research Paper R26, 9 p.-Research Paper R26, 9 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Extremal problems for -partite and -colorable hypergraphs.},
url = {http://eudml.org/doc/117222},
volume = {15},
year = {2008},
}

TY - JOUR
AU - Mubayi, Dhruv
AU - Talbot, John
TI - Extremal problems for -partite and -colorable hypergraphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper R26, 9 p.
EP - Research Paper R26, 9 p.
LA - eng
KW - maximumm number of edges; r-uniform hypergraph; t-chromatic hypergraph; Lagrangian of a hypergraph
UR - http://eudml.org/doc/117222
ER -