Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points

DOI10.1002/JCD.21690MaRDI QIDQ6185555zbMATH OpenFDO

Authors Alexander Sidorenko

Publication date 29 January 2024

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.08084

zbMATH Keywords

\(r\)-uniform hypergraphspartial Steiner systemsTurán-type problems

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Triple systems (05B07) Enumeration in graph theory (05C30) Hypergraphs (05C65) Blocking sets, ovals, (k)-arcs (51E21)

Abstract: For a family $mathcalF$ of $r$-graphs, let $mathrmex(n,mathcalF)$ denote the maximum number of edges in an $mathcalF$-free $r$-graph on $n$ vertices. Let ${mathcalF}_r(v,e)$ denote the family of all $r$-graphs with $e$ edges and at most $v$ vertices. We prove that $$.

Recommendations

• On the independence number of Steiner systems
• Triple systems with no three triples spanning at most five points
• A new extremal property of Steiner triple-systems
• Families of finite sets in which no set is covered by the union of \(r\) others
• Counting \(r\)-graphs without forbidden configurations

Cites work

• An extension of the Ruzsa-Szemerédi theorem
• Degenerate Turán densities of sparse hypergraphs
• scientific article; zbMATH DE number 3561377 (Why is no real title available?)
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• scientific article; zbMATH DE number 3258067 (Why is no real title available?)
• scientific article; zbMATH DE number 3407723 (Why is no real title available?)
• Large girth approximate Steiner triple systems
• On a packing and covering problem
• On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
• On an extremal hypergraph problem of Brown, Erdős and Sós
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Triple systems with no three triples spanning at most five points

Cited in

(1)

• On the ( k + 2, k)-problem of Brown, Erdős, and Sós for k = 5,6,7

This page was built for publication: Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points

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