On independent sets in hypergraphs
From MaRDI portal
Abstract: The independence number of a hypergraph H is the size of a largest set of vertices containing no edge of H. In this paper, we prove new sharp bounds on the independence number of n-vertex (r+1)-uniform hypergraphs in which every r-element set is contained in at most d edges, where 0 < d < n/(log n)^{3r^2}. Our relatively short proof extends a method due to Shearer. We give an application to hypergraph Ramsey numbers involving independent neighborhoods.
Recommendations
Cites work
- A Lower Bound for Heilbronn'S Problem
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A note on Ramsey numbers
- Arrangements of Lines with a Large Number of Triangles
- Coloring graphs with sparse neighborhoods
- Extremal uncrowded hypergraphs
- scientific article; zbMATH DE number 4014740 (Why is no real title available?)
- Hypergraphs with independent neighborhoods
- Independence numbers of locally sparse graphs and a Ramsey type problem
- Maximal Independent Subsets in Steiner Systems and in Planar Sets
- Note on independent sets in steiner systems
- On the independence number of sparse graphs
- On Triple Systems with Independent Neighbourhoods
- On uncrowded hypergraphs
- Quadruple systems with independent neighborhoods
- The Ramsey number R(3, t) has order of magnitude t2/log t
Cited in
(61)- Large independent sets in shift-invariant graphs
- Independence numbers of hypergraphs with sparse neighborhoods.
- On the number of independent sets in simple hypergraphs
- Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
- Coloring the normalized Laplacian for oriented hypergraphs
- General independence sets in random strongly sparse hypergraphs
- Access balancing in storage systems by labeling partial Steiner systems
- Counting independent sets in regular hypergraphs
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
- On the number of independent sets in uniform, regular, linear hypergraphs
- New bounds on the field size for maximally recoverable codes instantiating grid-like topologies
- Transversals and independence in linear hypergraphs with maximum degree two
- General position subsets and independent hyperplanes in d-space
- Block avoiding point sequencings of partial Steiner systems
- Hypergraph Ramsey numbers: tight cycles versus cliques
- Independence in uniform linear triangle-free hypergraphs
- The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3
- Independent sets of m,n-gonal graphs
- Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs
- The independent neighborhoods process
- On subgraphs of bounded degeneracy in hypergraphs
- Independence and Matchings in $\sigma$-hypergraphs
- On vertex independence number of uniform hypergraphs
- Independence densities of hypergraphs
- A note on coloring line arrangements
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Independent Transversals in Sparse Partite Hypergraphs
- On the matching number and the independence number of a random induced subhypergraph of a hypergraph
- Codegree Turán density of complete r-uniform hypergraphs
- On the average size of independent sets in triangle-free graphs
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- A note on improved upper bounds on the transversal number of hypergraphs
- Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints
- On uncrowded hypergraphs
- Hypergraph Independent Sets
- Independent sets in hypergraphs with a forbidden link
- scientific article; zbMATH DE number 3893238 (Why is no real title available?)
- scientific article; zbMATH DE number 5593359 (Why is no real title available?)
- Independent sets in hypergraphs
- On Independent Sets and Bicliques in Graphs
- Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques
- Differential Methods for Finding Independent Sets in Hypergraphs
- scientific article; zbMATH DE number 7666858 (Why is no real title available?)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Independent sets in hypergraphs omitting an intersection
- Independence number of hypergraphs under degree conditions
- Large independent sets from local considerations
- Large monochromatic components in 3‐edge‐colored Steiner triple systems
- Hypergraphs with independent neighborhoods
- Asymptotic existence of egalitarian Steiner 2-designs
- Large cliques or cocliques in hypergraphs with forbidden order-size pairs
- A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R
- Independent sets in hypergraphs
- Some combinatorial algorithms on the independent number of k-regular connected hypergraphs
- Off-diagonal Ramsey numbers for slowly growing hypergraphs
- Fractional clique decompositions of dense hypergraphs
- Combinatorics. Abstracts from the workshop held January 4--9, 2026
- On the independence number of non-uniform uncrowded hypergraphs
- Independent sets in quasi-regular graphs
- Independence in 5-uniform hypergraphs
- Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence
This page was built for publication: On independent sets in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5409863)
