On the (6,4)-problem of Brown, Erdős, and Sós

DOI10.1090/BPROC/170zbMATH Open1542.05131MaRDI QIDQ6562822FDOQ6562822

Authors: Stefan Glock, Felix Joos, Jaehoon Kim, M. Kuhn, Lyuben Lichev, Oleg Pikhurko 

Publication date: 27 June 2024

Published in: Proceedings of the American Mathematical Society. Series B (Search for Journal in Brave)

zbMATH Keywords

Turán numberBrown-Erdős-Sós conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• On a packing and covering problem
• Near perfect coverings in graphs and hypergraphs
• Title not available (Why is that?)
• Asymptotic behavior of the chromatic index for hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On an extremal hypergraph problem of Brown, Erdős and Sós
• Degenerate Turán densities of sparse hypergraphs
• On a conjecture of Erdős on locally sparse Steiner triple systems
• Large girth approximate Steiner triple systems
• Triple systems with no three triples spanning at most five points
• Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity
• The limit in the $(k+2, k)$-Problem of Brown, Erd\H{o}s and S\'os exists for all $k\geq 2$

Cited In (1)

• Turán numbers of \(r\)-graphs on \(r + 1\) vertices

This page was built for publication: On the \((6,4)\)-problem of Brown, Erdős, and Sós

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