Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Induced Turán problems and traces of hypergraphs (2002.07350v1)

Published 18 Feb 2020 in math.CO

Abstract: Let $F$ be a graph. We say that a hypergraph $H$ contains an induced Berge $F$ if the vertices of $F$ can be embedded to $H$ (e.g., $V(F)\subseteq V(H)$) and there exists an injective mapping $f$ from the edges of $F$ to the hyperedges of $H$ such that $f(xy) \cap V(F) = {x,y}$ holds for each edge $xy$ of $F$. In other words, $H$ contains $F$ as a trace. Let $ex_{r}(n,B_{ind} F)$ denote the maximum number of edges in an $r$-uniform hypergraph with no induced Berge $F$. Let $ex(n,K_r, F)$ denote the maximum number of $K_r$'s in an $F$-free graph on $n$ vertices. We show that these two Tur\'an type functions are strongly related.

Summary

We haven't generated a summary for this paper yet.