Counting families of mutually intersecting sets

zbMath1267.05144MaRDI QIDQ1953483

Yanyan Li

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p8

zbMATH Keywords

Kneser graph; counting independent sets; maximal linked systems

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

05C75: Structural characterization of families of graphs

Related Items

On Mubayi's Conjecture and Conditionally Intersecting Sets, In memoriam Albert Verbeek (1946–1990), Automorphism groups of superextensions of finite monogenic semigroups, Unnamed Item, How many cliques can a clique cover cover?, A note on the orientation covering number, On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method, On the foundations and extremal structure of the holographic entropy cone

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A computation of the eighth Dedekind number
• The order dimension of the complete graph
• Voting fairly: Transitive maximal intersecting families of sets
• On Counting Independent Sets in Sparse Graphs
• Substructure lattices of models of arithmetic
• On Dedekind's Problem: The Number of Monotone Boolean Functions