Triple systems with no three triples spanning at most five points

DOI10.1112/blms.12224zbMath1417.05236arXiv1809.02100OpenAlexW3103821949WikidataQ128859702 ScholiaQ128859702MaRDI QIDQ5229522

Stefan Glock

Publication date: 15 August 2019

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

\(r\)-uniform hypergraphoptimisation problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal set theory (05D05) Triple systems (05B07)

Related Items

Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity ⋮ Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points ⋮ Sparse hypergraphs: new bounds and constructions ⋮ Degenerate Turán densities of sparse hypergraphs

Cites Work

• An extension of the Ruzsa-Szemerédi theorem
• Asymptotic behavior of the chromatic index for hypergraphs
• 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
• On the existence of triangulated spheres in 3-graphs, and related problems
• Large girth approximate Steiner triple systems
• On graphs decomposable into induced matchings of linear sizes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Triple systems with no three triples spanning at most five points