Description
We say a hypergraph $\mathcal{H}$ contains a hypergraph $\mathcal{G}$ as trace if there exists a vertex subset $S \subseteq V(\mathcal{H})$ such that $|S| = |V(\mathcal{G})|$ and $\{e \cap S: e \in E(\mathcal{H})\}$ contains $\mathcal{G}$ as a sub-hypergraph. We use $\ex_r(n, \Tr_r(\mathcal{G}))$ to denote the maximum number of hyperedges in an $r$-uniform hypergraph on $n$ vertices not containing $\mathcal{G}$ as a trace. The study of Tur\'{a}n numbers for traces was initiated by Mubayi and Zhao who studied the case when $\mathcal{G}$ is a complete graph.
Let $M_{s+1}$ denote the graph of a matching with $s+1$ edges. In this paper, we give the upper bound of $\ex_r(n, \Tr_r(M_{s+1}))$ which is sharp asymptotically. When $r=3$, we give the exact value of $\ex_3 (n, \Tr_3 (M_{s+1}))$. We also consider the generalized Tur\'{a}n number in the case of matching. That is, the maximum number of copies of clique $\mathcal{K}_t^r$ in hypergraphs forbidding $\Tr_r (M_{s+1})$ as a trace. We give an upper bound which is sharp asymptotically and when $r=3$, we give the exact value. The Tur\'{a}n number of forbidding a matching and the other graph is another well studied topic initiated by Alon and Frankl.
We also consider an analogue problem for the trace version, i.e., forbidding trace of matching and trace of complete graph as subgraphs.
This talk is based on joint work with Yichen Wang, Ervin Győri and Xiamiao Zhao.
URL: https://us06web.zoom.us/j/89529608626?pwd=Y4YMgg9b3QvdPmbym7JPMTvyNMpPwb.1
Meeting ID: 895 2960 8626
Passcode: 627606