Independence number of hypergraphs under degree conditions

DOI10.1002/rsa.21151zbMath1522.05216arXiv2205.02877MaRDI QIDQ6076735

No author found.

Publication date: 17 October 2023

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

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

zbMATH Keywords

hypergraphindependent setsemi-random methoddegree Turán density

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the codegree density of complete 3-graphs and related problems
• On the independence number of non-uniform uncrowded hypergraphs
• A dense infinite Sidon sequence
• Extremal uncrowded hypergraphs
• Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
• Turan's theorem for \(k\)-graphs
• Co-degree density of hypergraphs
• Coloring Sparse Hypergraphs
• A note on the random greedy independent set algorithm
• ${\ell}$-Degree Turán Density
• Note on independent sets in steiner systems
• Codegree Turán Density of Complete $r$-Uniform Hypergraphs
• On independent sets in hypergraphs
• Independent sets in hypergraphs omitting an intersection

This page was built for publication: Independence number of hypergraphs under degree conditions