A note on the probabilistic approach to Turan's problem

DOI10.1016/0095-8956(83)90045-XzbMath0519.05050OpenAlexW1982564088MaRDI QIDQ1054749

Dominique De Caen

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(83)90045-x

zbMATH Keywords

Turan numberTuran's problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Combinatorial probability (60C05)

Related Items (5)

What we know and what we do not know about Turán numbers ⋮ On set systems with a threshold property ⋮ Cutting a graph into two dissimilar halves ⋮ Asymptotic Bounds for General Covering Designs ⋮ Bounds on the sizes of constant weight covering codes

Cites Work

• On the combinatorial problems which I would most like to see solved
• On a conjecture of Turán
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the probabilistic approach to Turan's problem