Corrigendum to: ``Trees and n-good hypergraphs

MaRDI QIDQ5206917zbMATH OpenFDO

Authors Mark Budden, Andrew Penland

Publication date 19 December 2019

Full work available at URL http://ajc.maths.uq.edu.au/pdf/75/ajc_v75_p171.pdf

zbMATH Keywords

\(r\)-uniform hypergraph Ramsey numbers\(r\)-uniform hypergraphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Recommendations

• Corrigendum to: ``Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees
• Corrigendum to: ``The asymptotic number of connected \(d\)-uniform hypergraphs
• scientific article; zbMATH DE number 26840
• Corrigendum to ``The rank of \(n{\times}n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\)
• Trees and n-good hypergraphs

Cites work

• Ramsey numbers for a disjoint union of good graphs
• Trees and n-good hypergraphs

Cited in

(5)

• Corrigendum to: ``Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees
• scientific article; zbMATH DE number 4130413 (Why is no real title available?)
• scientific article; zbMATH DE number 2109279 (Why is no real title available?)
• Minimally connected \(r\)-uniform hypergraphs
• Corrigendum to: ``The asymptotic number of connected \(d\)-uniform hypergraphs

This page was built for publication: Corrigendum to: ``Trees and \(n\)-good hypergraphs

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