Inequalities in probability theory and turán-type problems for graphs with colored vertices

DOI10.1002/rsa.3240020107zbMath0763.05048OpenAlexW1972281982MaRDI QIDQ3970903

Alexander Sidorenko

Publication date: 25 June 1992

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240020107

zbMATH Keywords

inequalitiesidentically distributed random elementsTurán-type problems for graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

A partially ordered set of functionals corresponding to graphs ⋮ Boundedness of optimal matrices in extremal multigraph and digraph problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• Hypergraphs do not jump
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• Extremal problems for directed graphs
• EXTREMAL ESTIMATES OF PROBABILITY MEASURES AND THEIR COMBINATORIAL NATURE
• Algorithmic Solution of Extremal Digraph Problems
• ?Best? estimations on the distribution of the length of sums of two random vectors
• Inequalities for the Distribution of the Length of Random Vector Sums
• Maxima for Graphs and a New Proof of a Theorem of Turán

This page was built for publication: Inequalities in probability theory and turán-type problems for graphs with colored vertices