Tur\'an Numbers of Ordered Tight Hyperpaths

MaRDI QIDQ6421884zbMATH OpenFDO

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

Publication date 28 December 2022

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Transversal (matching) theory (05D15)

Abstract: An ordered hypergraph is a hypergraph $G$ whose vertex set $V(G)$ is linearly ordered. We find the Tur'an numbers for the $r$-uniform $s$-vertex tight path $P_s^{(r)}$ (with vertices in the natural order) exactly when $rles<2r$ and $n$ is even; our results imply $$ when $rles<2r$. When $rge2s$, the asymptotics of $mathrm{ex}_{>}(n,P_s^{(r)})$ remain open. For $r=3$, we give a construction of an $r$-uniform $n$-vertex hypergraph not containing $P_s^{(r)}$ which we conjecture to be asymptotically extremal.

This page was built for publication: Tur\'an Numbers of Ordered Tight Hyperpaths

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