On the number of independent sets in simple hypergraphs

DOI10.1134/S0001434618010042zbMath1390.05156OpenAlexW2792465472WikidataQ130182381 ScholiaQ130182381MaRDI QIDQ1646333

Arseniy E. Balobanov, Dmitriy A. Shabanov

Publication date: 25 June 2018

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434618010042

zbMATH Keywords

hypergraphsimple hypergraph\(j\)-independent setmethod of containers

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets ⋮ First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees ⋮ Bounds on threshold probabilities for coloring properties of random hypergraphs ⋮ Coloring the normalized Laplacian for oriented hypergraphs ⋮ On the number of independent sets in uniform, regular, linear hypergraphs ⋮ Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs ⋮ On the weak chromatic number of random hypergraphs ⋮ Number of \(A + B \neq C\) solutions in abelian groups and application to counting independent sets in hypergraphs

Cites Work

• Hypergraph containers
• Independent sets in graphs
• Independent sets in regular graphs and sum-free subsets of finite groups
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• Counting independent sets in triangle-free graphs
• The Number of Independent Sets in a Regular Graph
• Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints
• On uncrowded hypergraphs
• Hypergraph Independent Sets
• Counting Independent Sets in Hypergraphs

This page was built for publication: On the number of independent sets in simple hypergraphs