TOPICS
Search

Frankl-Complete Configuration


A Frankl-complete configuration is a finite family G of sets with support U= union G, the set of elements occurring in its members, such that every finite union-closed set F containing G has an element of U belonging to at least half the members of F. Thus the configuration is a local certificate for the union-closed sets conjecture: whenever it occurs within a larger union-closed set, one of the elements already in its support must be frequent.

A configuration that is not Frankl-complete is called Non-FC. This does not make it a counterexample to the conjecture, since a witnessing union-closed set may have a frequent element outside U. Morris (2006) studied Frankl-complete configurations under the name FC-families.


See also

Ground Set, Morris's Conjecture, Union-Closed Set, Union-Closed Sets Conjecture

Explore with Wolfram|Alpha

References

Liu, M. "Frankl-Complete Sunflowers and Extremal Families of Four-Sets." Sep. 11, 2026. https://doi.org/10.5281/zenodo.22702735.Morris, R. "FC-Families and Improved Bounds for Frankl's Conjecture." European J. Combin. 27, 269-282, 2006. https://doi.org/10.1016/j.ejc.2004.07.012.

Cite this as:

Weisstein, Eric W. "Frankl-Complete Configuration." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Frankl-CompleteConfiguration.html

Subject classifications