A note on the Tur\'an number for the traces of hypergraphs

MaRDI QIDQ6401864zbMATH OpenFDO

Authors Bingchen Qian, Gennian Ge

Publication date 12 June 2022

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Abstract: Let $mathcalH$ be an $r$-uniform hypergraph and $F$ be a graph. We say $mathcalH$ contains $F$ as a trace if there exists some set $SsubseteqV(mathcalH)$ such that $mathcalH{|}_S:=EcapS:EinE(mathcalH)$ contains a subgraph isomorphic to $F.$ Let $e{x}_r(n,Tr(F))$ denote the maximum number of edges of an $n$-vertex $r$-uniform hypergraph $mathcalH$ which does not contain $F$ as a trace. In this paper, we improve the lower bounds of $e{x}_r(n,Tr(F))$ when $F$ is a star, and give some optimal cases. We also improve the upper bound for the case when $mathcalH$ is $3$-uniform and $F$ is $K_{2,t}$ when $t$ is small.

This page was built for publication: A note on the Tur\'an number for the traces of hypergraphs

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