An extremal problem on v-partite graphs

DOI10.1016/S0195-6698(83)80020-1MaRDI QIDQ789407zbMATH OpenWikidataFDO

Authors R. Paninski, J. Nešetřil, Horst Sachs

Publication date 1983

Published in European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

clique numbermonochromatic complete subgraphRamsey-type theoremclass parameter

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Recommendations

• On extremal problems of graphs and generalized graphs
• On complete subgraphs of r-chromatic graphs
• Turán-Ramsey theorems and simple asymptotically extremal structures
• Another extremal problem for Turan graphs
• A Ramsey type problem concerning vertex colourings

Cites work

• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• On Representatives of Subsets

Cited in

(2)

• Cliques in the union of \(C_4\)-free graphs
• Bounded \(VC\)-dimension implies the Schur-Erdős conjecture

This page was built for publication: An extremal problem on v-partite graphs

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