scientific article; zbMATH DE number 3833857
From MaRDI portal
Publication:3041079
Cited in
(27)- On homomorphisms from the Hamming cube to \(\mathbb{Z}\)
- How many delta-matroids are there?
- On the number of maximal independent sets in complete \(q\)-ary trees
- Enumeration of matchings in complete q-ary trees
- Note on the number of balanced independent sets in the Hamming cube
- The number of 4-colorings of the Hamming cube
- Independent sets in the middle two layers of Boolean lattice
- On the number of independent sets in uniform, regular, linear hypergraphs
- The number of maximal independent sets in the Hamming cube
- Rigidity of proper colorings of \(\mathbb{Z}^d \)
- Independence entropy of \(\mathbb{Z}^{d}\)-shift spaces
- The independent set sequence of regular bipartite graphs
- The growth constant of odd cutsets in high dimensions
- Independent sets in graphs
- Independent sets in the hypercube revisited
- Independent sets of a given size and structure in the hypercube
- On the number of connected sets with the neighborhood of a given size in a graph
- Approximately counting independent sets in bipartite graphs via graph containers
- Homomorphisms from the torus
- Counting independent sets in percolated graphs via the Ising model
- A refined graph container lemma and applications to the hard-core model on bipartite expanders
- Independent sets in discrete tori of odd sidelength
- A sharp threshold for a random version of Sperner's theorem
- Sumsets in the hypercube
- H-coloring tori
- On Dedekind's problem, a sparse version of Sperner's theorem, and antichains of a given size in the Boolean lattice
- Independent sets in quasi-regular graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3041079)
