Extremal problems for k-colour graphs and exact inequalities for pairs of random elements

DOI10.1515/DMA.1991.1.3.271zbMATH Open0739.05051OpenAlexW2033759644MaRDI QIDQ3970875

Alexander Sidorenko

Publication date: 25 June 1992

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1991.1.3.271

zbMATH Keywords

vertex colouringmaximal number of edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Inequalities in probability theory and turán-type problems for graphs with colored vertices ⋮ Universal limit theorems in graph coloring problems with connections to extremal combinatorics ⋮ An extremal problem for random graphs and the number of graphs with large even-girth

This page was built for publication: Extremal problems for k-colour graphs and exact inequalities for pairs of random elements

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