# Simple juntas for shifted families

@article{Frankl2019SimpleJF,
title={Simple juntas for shifted families},
author={P. Frankl and A. Kupavskii},
journal={ArXiv},
year={2019},
volume={abs/1901.03816}
}
• Published 2019
• Mathematics, Computer Science
• ArXiv
• We say that a family $\mathcal F$ of $k$-element sets is a $j$-junta if there is a set $J$ of size $j$ such that, for any $F$, its presence in $\mathcal F$ depends on its intersection with $J$ only. Approximating arbitrary families by $j$-juntas with small $j$ is a recent powerful technique in extremal set theory. The weak point of all known approximation by juntas results is that they work in the range $n>Ck$, where $C$ is an extremely fast-growing function of the input parameters, such as the… CONTINUE READING
2 Citations

#### Topics from this paper

Rainbow matchings in k-partite hypergraphs
• Mathematics, Computer Science
• ArXiv
• 2020
• 1
• PDF

#### References

SHOWING 1-10 OF 15 REFERENCES
On Rainbow Matchings for Hypergraphs
• Mathematics, Computer Science
• SIAM J. Discret. Math.
• 2018
• 3
• PDF
Rainbow Matchings in Properly-Colored Hypergraphs
• Mathematics, Computer Science
• Electron. J. Comb.
• 2019
• 1
• PDF
Intersecting Families are Essentially Contained in Juntas
• Mathematics, Computer Science
• Comb. Probab. Comput.
• 2009
• 51
• PDF
The Size of a Hypergraph and its Matching Number
• Computer Science, Mathematics
• Comb. Probab. Comput.
• 2012
• 75
• Highly Influential
• PDF
Improved bounds for Erdős' Matching Conjecture
• P. Frankl
• Computer Science, Mathematics
• J. Comb. Theory, Ser. A
• 2013
• 93
• PDF
A theorem of finite sets
• 251
• Highly Influential