Turán numbers of r-graphs on r + 1 vertices

DOI10.1016/J.JCTB.2024.06.004zbMATH Open1548.05178MaRDI QIDQ6615752FDOQ6615752

Authors: Alexander Sidorenko 

Publication date: 8 October 2024

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Recommendations

• An exact result for hypergraphs and upper bounds for the Turán density of \(K^r_{r+1}\)
• The Turán problem for hypergraphs on fixed size
• On the Turán density of uniform hypergraphs
• Turán densities of some hypergraphs related to \(K_{k+1}^{k}\)
• On ramsey-tuŕan numbers for 3-graphs

zbMATH Keywords

Turán densityTurán-type problemthree edge problem

Mathematics Subject Classification ID

Density estimation (62G07) Enumeration in graph theory (05C30) Hypergraphs (05C65)

Cites Work

• Title not available (Why is that?)
• Daisies and other Turán problems
• Title not available (Why is that?)
• On the theory of order statistics
• What we know and what we do not know about Turán numbers
• Approximate distributions of order statistics. With applications to nonparametric statistics
• Title not available (Why is that?)
• An exact result for 3-graphs
• On an extremal hypergraph problem of Brown, Erdős and Sós
• Title not available (Why is that?)
• Upper bounds for Turán numbers
• Remarques sur deux problèmes extrémaux. (Remarks on two extremal problems)
• THE MINIMUM OF HIGHER ORDER GAPS
• Tournaments, 4-uniform hypergraphs, and an exact extremal result
• Title not available (Why is that?)
• Vraagstuk XXVIII.
• Partite Turán-densities for complete \(r\)-uniform hypergraphs on \(r+1\) vertices
• Triple systems with no three triples spanning at most five points
• Matricial characterization of tournaments with maximum number of diamonds
• Lower bounds for the Turán densities of daisies
• The limit in the $(k+2, k)$-Problem of Brown, Erd\H{o}s and S\'os exists for all $k\geq 2$
• On the \((6,4)\)-problem of Brown, Erdős, and Sós

Cited In (3)

• On asymptotic local Turán problems
• Turán numbers and switching
• On Turán numbers for disconnected hypergraphs

This page was built for publication: Turán numbers of \(r\)-graphs on \(r + 1\) vertices

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