Independence densities of hypergraphs

DOI10.1016/J.EJC.2014.03.001zbMath1300.05194arXiv1308.2837OpenAlexW2134068413MaRDI QIDQ402469

Dieter Mitsche, Jason I. Brown, Paweł Prałat, Anthony Bonato

Publication date: 28 August 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

independence polynomials\(F\)-free densities of graphs

Mathematics Subject Classification ID

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

Related Items (2)

Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs ⋮ On vertex independence number of uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independence and chromatic densities of graphs
• On the location of roots of independence polynomials
• Densities of minor-closed graph families
• Limits of dense graph sequences
• On jumping densities of hypergraphs
• Bipartite density of triangle-free subcubic graphs
• Potts model on infinite graphs and the limit of chromatic polynomials
• Co-degree density of hypergraphs
• Domination and leaf density in graphs
• Chromatic polynomials and their zeros and asymptotic limits for families of graphs

This page was built for publication: Independence densities of hypergraphs