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

DOI10.1002/jcd.21690arXiv1907.08084MaRDI QIDQ6185555

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

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An extension of the Ruzsa-Szemerédi theorem
• On an extremal hypergraph problem of Brown, Erdős and Sós
• On a packing and covering problem
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Degenerate Turán densities of sparse hypergraphs
• On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
• Large girth approximate Steiner triple systems
• Triple systems with no three triples spanning at most five points

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