Turán numbers of ordered tight hyperpaths

DOI10.1016/J.EJC.2024.104070MaRDI QIDQ6655692zbMATH OpenFDO

Authors John P. Bright, Kevin G. Milans, Jackson Porter

Publication date 27 December 2024

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2024.104070

zbMATH Keywords

\(r\)-uniform \(n\)-vertex hypergraph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Hypergraphs (05C65)

Recommendations

• Turán numbers for forests of paths in hypergraphs
• Ramsey problems for monotone paths in graphs and hypergraphs
• Tight paths in convex geometric hypergraphs
• Ordered Ramsey numbers of loose paths and matchings
• Turán problems and shadows. I: Paths and cycles

Cites work

• Exact solution of some Turán-type problems
• Extremal problems for convex geometric hypergraphs and ordered hypergraphs
• Forbidden paths and cycles in ordered graphs and matrices
• scientific article; zbMATH DE number 3843786 (Why is no real title available?)
• scientific article; zbMATH DE number 3752842 (Why is no real title available?)
• Hypergraphs not containing a tight tree with a bounded trunk
• On the Turán number of ordered forests
• On the Turán number of some ordered even cycles
• Tight paths in convex geometric hypergraphs

Cited in

(1)

• Ramsey problems for monotone paths in graphs and hypergraphs

This page was built for publication: Turán numbers of ordered tight hyperpaths

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