The independent set sequence of regular bipartite graphs

DOI10.1016/j.disc.2012.06.011zbMath1248.05138arXiv1110.3760OpenAlexW2022733949MaRDI QIDQ449128

David Galvin

Publication date: 12 September 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.3760

zbMATH Keywords

regular graphdiscrete hypercubeindependent set polynomialstable set polynomialunimodal sequence

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Independent sets of a given size and structure in the hypercube ⋮ Two problems on independent sets in graphs

Cites Work

• \(H\)-colouring bipartite graphs
• Two problems on independent sets in graphs
• The roots of the independence polynomial of a clawfree graph
• Matchings and independent sets of a fixed size in regular graphs
• On the numbers of independent \(k\)-sets in a claw free graph
• Theory of monomer-dimer systems
• A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube
• The Number of Independent Sets in a Regular Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item