Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs

zbMath1179.05115MaRDI QIDQ1010732

Dhruv Mubayi, John Talbot

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117222

zbMATH Keywords

r-uniform hypergraphLagrangian of a hypergraphmaximumm number of edgest-chromatic hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Analytic methods for uniform hypergraphs ⋮ An Extremal Graph Problem with a Transcendental Solution ⋮ The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs

This page was built for publication: Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs