Recent advances in arrow relations and traces of sets
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:2S4NCRGQrecord.jsonopen to challenge →
read the original abstract
The arrow relation, a central concept in extremal set theory, captures quantitative relationships between families of sets and their traces. Formally, the arrow relation $(n, m) \rightarrow (a, b)$ signifies that for any family $\mathcal{F} \subseteq 2^{[n]}$ with $|\mathcal{F}| \geqslant m$, there exists an $a$-element subset $T \subseteq [n]$ such that the trace $\mathcal{F}_{|T} = \{ F \cap T : F \in \mathcal{F} \}$ contains at least $b$ distinct sets. This survey highlights recent progress on a variety of problems and results connected to arrow relations. We explore diverse topics, broadly categorized by different extremal perspectives on these relations, offering a cohesive overview of the field.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Forbidding matching as trace in uniform hypergraphs
The trace Turán number ex_r(n, Tr_r(M_{s+1})) admits an asymptotically tight upper bound, with exact determination for r=3, and analogous sharp bounds hold for the generalized clique-counting version.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.