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

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

Alexander Sidorenko

Publication date: 8 October 2024

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

zbMATH Keywords

Turán-type problemTurán densitythree edge problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Remarques sur deux problèmes extrémaux. (Remarks on two extremal problems)
• An exact result for 3-graphs
• On an extremal hypergraph problem of Brown, Erdős and Sós
• Approximate distributions of order statistics. With applications to nonparametric statistics
• Vraagstuk XXVIII.
• What we know and what we do not know about Turán numbers
• Partite Turán-densities for complete \(r\)-uniform hypergraphs on \(r+1\) vertices
• Matricial characterization of tournaments with maximum number of diamonds
• Tournaments, 4-uniform hypergraphs, and an exact extremal result
• THE MINIMUM OF HIGHER ORDER GAPS
• Daisies and Other Turán Problems
• Triple systems with no three triples spanning at most five points
• On the theory of order statistics
• Upper bounds for Turán numbers
• 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

Related Items (1)

Turán numbers and switching

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)