The distance of \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} \(\mathcal{F}\) \end{document}-free hypergraphs

DOI10.1556/SSCMATH.46.2009.2.1090zbMath1231.05138OpenAlexW1786648276MaRDI QIDQ3076879

Balázs Patkós

Publication date: 25 February 2011

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1556/sscmath.46.2009.2.1090

zbMATH Keywords

cyclescomplete subgraphsSperner systems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (3)

On Generalized Turán Results in Height Two Posets ⋮ On the number of containments in \(P\)-free families ⋮ Generalized forbidden subposet problems

This page was built for publication: The distance of \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} \(\mathcal{F}\) \end{document}-free hypergraphs