Extremal problems for t-partite and t-colorable hypergraphs

MaRDI QIDQ1010732zbMATH OpenFDO

Authors 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, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r26.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• On Ramsey - Turan type theorems for hypergraphs
• Multipartite Turán problem for connected graphs and hypergraphs
• scientific article; zbMATH DE number 3470458
• scientific article; zbMATH DE number 761755
• Coverings of r—graphs by complete r—partite subgraphs

Cited in

(5)

• An Extremal Graph Problem with a Transcendental Solution
• Ramsey properties of algebraic graphs and hypergraphs
• Analytic methods for uniform hypergraphs
• The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
• Multipartite Turán problem for connected graphs and hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010732)