# Counting Families of Mutually Intersecting Sets

@article{Brouwer2013CountingFO,
title={Counting Families of Mutually Intersecting Sets},
author={Andries E. Brouwer and C. F. Mills and W. H. Mills and A. Verbeek},
journal={Electron. J. Comb.},
year={2013},
volume={20},
pages={8}
}
• Published 9 April 2013
• Mathematics
• Electron. J. Comb.
We determine the number of maximal intersecting families on a 9-set and nd 423295099074735261880. We determine the number of independent sets of the Kneser graph K(9; 4) and nd 366996244568643864340. We determine the number of intersecting families on an 8-set and on a 9-set and nd 14704022144627161780744368338695925293142507520 and 12553242487940503914363982718112298267975272720808010757809032705650591023015520462677475328 (roughly 1:255 10 91 ), respectively.
How many cliques can a clique cover cover?
• Mathematics
• 2022
This work examines the problem of clique enumeration on a graph by exploiting its clique covers. The principle of inclusion/exclusion is applied to determine the number of cliques of size r in the
Clique Structure of Orthomodular Posets
Dacey graphs include looped structures of maximal cliques when two maximal cliques cover a third. Dacey established a class of simple, finite graphs, called Dacey graphs, which corresponds to the set
Automorphism groups of superextensions of groups
• Mathematics
• 2017
The superextension $\lambda(X)$ of a set $X$ consists of all maximal linked families on $X$. Any associative binary operation $*: X\times X \to X$ can be extended to an associative binary operation
On the foundations and extremal structure of the holographic entropy cone
• Mathematics
• 2021
The holographic entropy cone (HEC) is a polyhedral cone first introduced in the study of a class of quantum entropy inequalities. It admits a graph-theoretic description in terms of minimum cuts in
On Mubayi's Conjecture and Conditionally Intersecting Sets
• Mathematics
SIAM J. Discret. Math.
• 2018
It is proved that Mubayi's Conjecture is true for all families that are invariant with respect to shifting; indeed, these families satisfy a stronger version of Mubayei'sconjecture.
Structural and computational aspects of simple and influence games
It is proved that the problem of deciding whether a simple game in minimal winning form is decisive can be solved in quasi-polynomial time, and that this problem can be polynomially reduced to the same problem but restricted to regular games in shift-minimal winning form.
Automorphism groups of superextensions of finite monogenic semigroups.
• Mathematics
• 2019
A family $\mathcal L$ of subsets of a set $X$ is called linked if $A\cap B\ne\emptyset$ for any $A,B\in\mathcal L$. A linked family $\mathcal M$ of subsets of $X$ is maximal linked if $\mathcal M$
q-Congruences, with applications to supercongruences and the cyclic sieving phenomenon
• O. Gorodetsky
• Mathematics
International Journal of Number Theory
• 2019
We establish a supercongruence conjectured by Almkvist and Zudilin, by proving a corresponding [Formula: see text]-supercongruence. Similar [Formula: see text]-supercongruences are established for
Intersection theorems for families of matchings of complete $k$-partite $k$-graphs
The celebrated Erd\H{o}s-Ko-Rado Theorem and other intersection theorems on families of sets have previously been generalised with respect to families of permutations. We prove that many of these

## References

SHOWING 1-10 OF 19 REFERENCES
Voting Fairly: Transitive Maximal Intersecting Families of Sets
• Mathematics
J. Comb. Theory, Ser. A
• 2000
The enumeration of the 207,650,662,008 maximal families of intersecting subsets of X whose group of symmetries is transitive for |X|<13.
The order dimension of the complete graph
• Mathematics
Discret. Math.
• 1999
A computation of the eighth Dedekind number
We compute the eighth Dedekind number, or the number of monotone collections of subsets of a set with eight elements. The number obtained is 56, 130, 437, 228, 687, 557, 907, 788.
On counting independent sets in sparse graphs
• Mathematics
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
• 1999
Two results are proved concerning approximate counting of independent sets in graphs with constant maximum degree $\Delta$ that imply that the Markov chain Monte Carlo technique is likely to fail and that no fully polynomial randomized approximation scheme can exist for $\Delta \geq 25$ unless $\mathrm{RP}=\mathrm(NP)$.
On Dedekind’s problem: The number of monotone Boolean functions
with an = ce~nli, /3„ = e'(Iog w)/«1'2.The number \p(n) is equal to the number of ideals, or of antichains,or of monotone increasing functions into 0 and 1 definable on thelattice of subsets of an
Problems and Results in Combinatorial Analysis
I gave many lectures by this and similar titles, many in fact in these conferences and I hope in my lecture in 1978 I will give a survey of the old problems and describe what happened to them. In the
Stable Winning Coalitions
• D. Loeb
• Computer Science, Economics
• 1996
We introduce the notion of a stable winning coalition in a multiplayer game as a new system of classification of games. An axiomatic refinement of this classification for three-player games is also
The Art of Computer Programming
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Counting families of mutually intersecting sets, internal report
• ZN 41, Afd. Zuivere Wiskunde, Math. Centrum,
• 1972