Independent sets in hypergraphs
From MaRDI portal
Cites work
- A Lower Bound for Heilbronn'S Problem
- A note on Ramsey numbers
- Arrangements of Lines with a Large Number of Triangles
- Coloring graphs with sparse neighborhoods
- Coloring simple hypergraphs
- Coloring sparse hypergraphs
- Counting independent sets in graphs
- Extremal uncrowded hypergraphs
- scientific article; zbMATH DE number 4014740 (Why is no real title available?)
- scientific article; zbMATH DE number 3874089 (Why is no real title available?)
- Hypergraph containers
- Hypergraph Ramsey numbers: triangles versus cliques
- Hypergraphs with independent neighborhoods
- Improved lower bounds on k‐independence
- Independence numbers of locally sparse graphs and a Ramsey type problem
- Independent sets in hypergraphs
- Maximal Independent Subsets in Steiner Systems and in Planar Sets
- Note on independent sets in steiner systems
- On a packing and covering problem
- On independent sets in hypergraphs
- On the chromatic number of simple triangle-free triple systems
- On the independence number of sparse graphs
- On the independence number of Steiner systems
- On uncrowded hypergraphs
- Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth
- The early evolution of the \(H\)-free process
- The independent neighborhoods process
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The Ramsey number R(3, t) has order of magnitude t2/log t
This page was built for publication: Independent sets in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857767)
