Counting Independent Sets in Hypergraphs

DOI10.1017/S0963548314000182zbMath1304.05105arXiv1310.6672OpenAlexW3103380764MaRDI QIDQ5495674

Dhruv Mubayi, Kunal Dutta, Jeff Cooper

Publication date: 6 August 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

linear hypergraphtriangle-free process

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (6)

Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs ⋮ On the number of independent sets in simple hypergraphs ⋮ On the average size of independent sets in triangle-free graphs ⋮ Coloring unions of nearly disjoint hypergraph cliques ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the number of independent sets in uniform, regular, linear hypergraphs

Cites Work

• A note on the independence number of triangle-free graphs
• A dense infinite Sidon sequence
• Extremal uncrowded hypergraphs
• On Turan's theorem for sparse graphs
• The number of \(t\)-wise balanced designs
• Nearly perfect matchings in regular simple hypergraphs
• On the number of partial Steiner systems
• On uncrowded hypergraphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On the independence number of sparse graphs
• Concentration of multivariate polynomials and its applications
• Graph colouring and the probabilistic method

This page was built for publication: Counting Independent Sets in Hypergraphs