The independent neighborhoods process

DOI10.1007/S11856-016-1331-8zbMath1344.05101arXiv1407.7192OpenAlexW149180728MaRDI QIDQ312273

Dhruv Mubayi, Tom Bohman, Michael E. Picollelli

Publication date: 15 September 2016

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey numberindependent sets in hypergraphs\(r\)-uniform hypergraph

Mathematics Subject Classification ID

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

Related Items (3)

On the Random Greedy $F$-Free Hypergraph Process ⋮ Hypergraph Ramsey numbers of cliques versus stars ⋮ The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\)

Cites Work

• Unnamed Item
• Unnamed Item
• The early evolution of the \(H\)-free process
• The triangle-free process
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• A note on the independence number of triangle-free graphs. II
• Coloring Sparse Hypergraphs
• A note on the random greedy independent set algorithm
• Coloring H-free hypergraphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• On independent sets in hypergraphs
• Dynamic concentration of the triangle-free process

This page was built for publication: The independent neighborhoods process