TOPICS
Search

Hypergraph Shadow


The hypergraph shadow partialH, or simply shadow, of an r-uniform hypergraph H is the (r-1)-uniform hypergraph consisting of all (r-1)-element subsets contained in at least one hyperedge of H, namely

 partialH={e subset= V(H):|e|=r-1, e subset= h for some h in E(H)}.

More generally, for 1<=s<r, the s-shadow consists of the s-element subsets contained in the hyperedges of H. Hypergraph shadows are central in extremal set theory. The shadow bound proving Kalai's conjecture is one example.


See also

Hyperedge, Hypergraph, Kalai's Conjecture for Tight Trees, Subset, Tight Tree

Explore with Wolfram|Alpha

References

Frankl, P. and Füredi, Z. "Exact Solution of Some Turán-Type Problems." J. Combin. Theory Ser. A 45, 226-262, 1987. https://doi.org/10.1016/0097-3165(87)90016-1.Mubayi, D. and Verstraëte, J. "Kalai's Conjecture for Tight Trees." 7 Sep 2026. https://arxiv.org/abs/2609.08012.

Cite this as:

Weisstein, Eric W. "Hypergraph Shadow." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/HypergraphShadow.html

Subject classifications