Independent sets in hypergraphs omitting an intersection

DOI10.1002/rsa.21071zbMath1522.05338arXiv2101.04258OpenAlexW4205882471MaRDI QIDQ6052482

Xizhi Liu, Tom Bohman, Dhruv Mubayi

Publication date: 17 October 2023

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

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

zbMATH Keywords

independent setspseudorandom hypergraphsL-intersecting familiesrandom greedy processes

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (1)

Independence number of hypergraphs under degree conditions

Cites Work

• Unnamed Item
• The de Bruijn-Erdős theorem for hypergraphs
• A new generalization of Mantel's theorem to \(k\)-graphs
• Using Lovász local lemma in the space of random injections
• A note on embedding hypertrees
• Forbidding just one intersection
• A note on Ramsey numbers
• Extremal uncrowded hypergraphs
• On Turan's theorem for sparse graphs
• Mathematics of Ramsey theory. Collected papers of the Prague symposium on graph theory held in Prague, Czechoslovakia
• Sparse hypergraphs with low independence number
• Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
• Hypergraph Ramsey numbers: triangles versus cliques
• Turan's theorem for \(k\)-graphs
• A note on the random greedy independent set algorithm
• Introduction to Random Graphs
• Intersection Properties of Systems of Finite Sets
• Note on independent sets in steiner systems
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On the independence number of sparse graphs
• On the Independence Number of Steiner Systems
• On independent sets in hypergraphs

This page was built for publication: Independent sets in hypergraphs omitting an intersection