Independence densities of hypergraphs

DOI10.1016/J.EJC.2014.03.001MaRDI QIDQ402469zbMATHOpenAlexFDO

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

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

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

Abstract: We consider the number of independent sets in hypergraphs, which allows us to define the independence density of countable hypergraphs. Hypergraph independence densities include a broad family of densities over graphs and relational structures, such as $F$-free densities of graphs for a given graph $F.$ In the case of $k$-uniform hypergraphs, we prove that the independence density is always rational. In the case of finite but unbounded hyperedges, we show that the independence density can be any real number in $[0,1].$ Finally, we extend the notion of independence density via independence polynomials.

Recommendations

• Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs
• Independence and chromatic densities of graphs
• On independent sets in hypergraphs
• On the independence number of non-uniform uncrowded hypergraphs
• Independence in 5-uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 3224335 (Why is no real title available?)
• Bipartite density of triangle-free subcubic graphs
• Chromatic polynomials and their zeros and asymptotic limits for families of graphs
• Co-degree density of hypergraphs
• Densities of minor-closed graph families
• Domination and leaf density in graphs
• Independence and chromatic densities of graphs
• Introduction to graph and hypergraph theory
• Limits of dense graph sequences
• On jumping densities of hypergraphs
• On the location of roots of independence polynomials
• Potts model on infinite graphs and the limit of chromatic polynomials
• The cop density of a graph

Cited in

(6)

• Independence and chromatic densities of graphs
• Bipartite density and the independence ratio
• On vertex independence number of uniform hypergraphs
• Independent sets in algebraic hypergraphs
• Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence
• Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs

This page was built for publication: Independence densities of hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402469)