scientific article; zbMATH DE number 4160792
From MaRDI portal
Publication:3487396
zbMATH Open0707.05059MaRDI QIDQ3487396FDOQ3487396
Authors: Alexander Sapozhenko
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
- On the number of connected sets in bounded degree graphs
- On the Number of Connected Sets in Bounded Degree Graphs
- Bounds for proper \(k\)-connectivity of complete bipartite graphs
- On the number of connected subgraphs of graphs
- The extremal number of the subdivisions of the complete bipartite graph
- On the number of maximal bipartite subgraphs of a graph
- On lower bounds for the \(b\)-chromatic number of connected bipartite graphs
- On the number of connected subgraphs with small edge‐boundary in regular graphs
- Bounds on the number of complete subgraphs
- On extremal bipartite graphs with a given connectivity
Cited In (31)
- Estimation of the number of connected sets in a graph and the structure of components of random subsets
- Homomorphisms from the torus
- Independent sets in the middle two layers of Boolean lattice
- Intersecting families of sets are typically trivial
- Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\)
- On computing boundary functional sums
- The quantifier semigroup for bipartite graphs
- Hypergraph containers
- The method of boundary functionals for non-regular structures
- The number of 4-colorings of the Hamming cube
- On the number of connected sets with the neighborhood of a given size in a graph
- Concatenating bipartite graphs
- Note on the number of balanced independent sets in the Hamming cube
- List colorings of multipartite hypergraphs
- Phase coexistence and torpid mixing in the 3-coloring model on \({\mathbb Z}^d\)
- Independent sets in the hypercube revisited
- The growth constant of odd cutsets in high dimensions
- On the number of connected subgraphs with small edge‐boundary in regular graphs
- Online containers for hypergraphs, with applications to linear equations
- Approximately counting independent sets in bipartite graphs via graph containers
- The number of maximal independent sets in the Hamming cube
- Algorithms for the ferromagnetic Potts model on expanders
- On the Number of Connected Sets in Bounded Degree Graphs
- Matchings in random spanning subgraphs of cubelike graphs
- Title not available (Why is that?)
- The Cameron-Erdős conjecture
- Sampling independent sets in the discrete torus
- Rigidity of proper colorings of \(\mathbb{Z}^d \)
- Independent sets of a given size and structure in the hypercube
- On Erdős-Ko-Rado for random hypergraphs. II
- On homomorphisms from the Hamming cube to \(\mathbb{Z}\)
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 Q3487396)