Continuous versions of some extremal hypergraph problems. II

DOI10.1007/BF01896826zbMATH Open0466.05052OpenAlexW2056995141MaRDI QIDQ3918151FDOQ3918151

Authors: Gyula O. H. Katona 

Publication date: 1980

Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01896826

zbMATH Keywords

hypergraphs problems of Turan-type

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Probabilistic measure theory (60A10)

Cites Work

• An inequality related to the isoperimetric inequality
• Intersection theorems for systems of finite sets
• Graphs with maximal number of adjacent pairs of edges
• A simple proof of the Kruskal-Katona theorem
• Rearrangements of \((0,-1)\) matrices
• A simple proof of the Kruskal-Katona theorem and of some associated binomial inequalities
• Title not available (Why is that?)
• Über einen Satz von Kruskal

Cited In (6)

• ?Best? estimations on the distribution of the length of sums of two random vectors
• Projection inequalities for antichains
• On vertex independence number of uniform hypergraphs
• A continuous analogue of Erdős' \(k\)-Sperner theorem
• A combinatorial approach to small ball inequalities for sums and differences
• A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems

This page was built for publication: Continuous versions of some extremal hypergraph problems. II

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