On independent sets in hypergraphs

DOI10.1002/rsa.20453zbMath1303.05141arXiv1106.3098OpenAlexW2085160038MaRDI QIDQ5409863

Dhruv Mubayi, Jacques Verstraete, Alexandr V. Kostochka

Publication date: 15 April 2014

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

Steiner systemshypergraphsindependent sets

Mathematics Subject Classification ID

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

Related Items (24)

Transversals and independence in linear hypergraphs with maximum degree two ⋮ Independence in uniform linear triangle-free hypergraphs ⋮ The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs ⋮ The independent neighborhoods process ⋮ Codegree Turán Density of Complete $r$-Uniform Hypergraphs ⋮ General position subsets and independent hyperplanes in \(d\)-space ⋮ Block avoiding point sequencings of partial Steiner systems ⋮ On vertex independence number of uniform hypergraphs ⋮ Independent sets in hypergraphs omitting an intersection ⋮ On the average size of independent sets in triangle-free graphs ⋮ A note on coloring line arrangements ⋮ Independence number of hypergraphs under degree conditions ⋮ Large monochromatic components in 3‐edge‐colored Steiner triple systems ⋮ Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques ⋮ Unnamed Item ⋮ Access balancing in storage systems by labeling partial Steiner systems ⋮ A note on improved upper bounds on the transversal number of hypergraphs ⋮ Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ⋮ Coloring the normalized Laplacian for oriented hypergraphs ⋮ New bounds on the field size for maximally recoverable codes instantiating grid-like topologies ⋮ Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs ⋮ Hypergraph Ramsey numbers: tight cycles versus cliques ⋮ The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3

Cites Work

• Unnamed Item
• Hypergraphs with independent neighborhoods
• Quadruple systems with independent neighborhoods
• On the chromatic number of simple triangle-free triple systems
• A note on Ramsey numbers
• Extremal uncrowded hypergraphs
• Coloring graphs with sparse neighborhoods
• Arrangements of Lines with a Large Number of Triangles
• A Lower Bound for Heilbronn'S Problem
• Maximal Independent Subsets in Steiner Systems and in Planar Sets
• Note on independent sets in steiner systems
• On uncrowded hypergraphs
• Independence numbers of locally sparse graphs and a Ramsey type problem
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On the independence number of sparse graphs
• On Triple Systems with Independent Neighbourhoods
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: On independent sets in hypergraphs