Hypergraph Independent Sets

DOI10.1017/S0963548312000454zbMath1257.05104MaRDI QIDQ4903260

Jonathan Cutler, Andrew John Radcliffe

Publication date: 21 January 2013

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

zbMATH Keywords

\(r\)-uniform hypergraph\(j\)-independent sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs ⋮ On the number of independent sets in simple hypergraphs ⋮ Maximizing \(2\)-independents sets in \(3\)-uniform hypergraphs ⋮ On vertex independence number of uniform hypergraphs ⋮ General independence sets in random strongly sparse hypergraphs ⋮ Bounds on threshold probabilities for coloring properties of random hypergraphs ⋮ On the number of independent sets in uniform, regular, linear hypergraphs ⋮ On the weak chromatic number of random hypergraphs ⋮ Zeon and idem-Clifford formulations of hypergraph problems

Cites Work

• Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs
• A variant of the hypergraph removal lemma
• Quick approximation to matrices and applications
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Maximizing the number of q -colorings
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• The Number of Independent Sets in a Regular Graph
• An Algorithmic Regularity Lemma for Hypergraphs