Counting independent sets in structured graphs
From MaRDI portal
Cites work
- A survey of -boundedness
- Computing tree decompositions with small independence number
- Counting independent sets in graphs
- Counting independent sets in triangle-free graphs
- Dependent random choice
- Dynamic concentration of the triangle‐free process
- Graphs with no induced \(K_{2,t}\)
- Hypergraph containers
- Independent sets in hypergraphs
- Independent sets in regular graphs and sum-free subsets of finite groups
- Induced subdivisions in \(K_{s,s}\)-free graphs with polynomial average degree
- Induced Turán numbers
- Induced Turán problem in bipartite graphs
- Kővári-Sós-Turán theorem for hereditary families
- On a problem of K. Zarankiewicz
- On diameters and radii of bridged graphs
- On extremal problems of graphs and generalized graphs
- On polynomial degree-boundedness
- On the average size of independent sets in triangle-free graphs
- On the number of graphs without 4-cycles
- Reducibility among combinatorial problems (1972)
- Sum-free sets in Abelian groups.
- The Asymptotic Number of Lattices
- The asymptotics of r(4,t)
- The method of hypergraph containers
- Treewidth versus clique number. II: Tree-independence number
This page was built for publication: Counting independent sets in structured graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879465)
