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

DOI10.1090/BPROC/170MaRDI QIDQ6562822zbMATH OpenFDO

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)

Full work available at URL https://doi.org/10.1090/BPROC/170

zbMATH Keywords

Brown-Erdős-Sós conjectureTurán number

Mathematics Subject Classification ID

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

Recommendations

• The limit in the $(k+2, k)$-Problem of Brown, Erd\H{o}s and S\'os exists for all $k\geq 2$
• On an extremal hypergraph problem of Brown, Erdős and Sós
• Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity
• On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
• The maximum size of hypergraphs without generalized 4-cycles

Cites work

• Asymptotic behavior of the chromatic index for hypergraphs
• Degenerate Turán densities of sparse hypergraphs
• Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity
• scientific article; zbMATH DE number 3561377 (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
• Near perfect coverings in graphs and hypergraphs
• On a conjecture of Erdős on locally sparse Steiner triple systems
• On a packing and covering problem
• On an extremal hypergraph problem of Brown, Erdős and Sós
• The limit in the $(k+2, k)$-Problem of Brown, Erd\H{o}s and S\'os exists for all $k\geq 2$
• Triple systems with no three triples spanning at most five points

Cited in

(9)

• The limit in the $(k+2, k)$-Problem of Brown, Erd\H{o}s and S\'os exists for all $k\geq 2$
• Turán numbers of r-graphs on r + 1 vertices
• On a problem of Brown, Erdős and Sós
• A random coloring process gives improved bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
• Generalized Ramsey numbers at the linear and quadratic thresholds
• On generalized Ramsey numbers in the non-integral regime
• The generalized Ramsey number \(f(n,5,8)=\frac{6}{7}n+o(n)\)
• On the quadratic 8-edge case of the Brown-Erdős-Sós problem
• On the ( k + 2, k)-problem of Brown, Erdős, and Sós for k = 5,6,7

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)