On the independence number of non-uniform uncrowded hypergraphs

DOI10.1016/j.disc.2020.111964zbMath1443.05148OpenAlexW3026113632WikidataQ112880940 ScholiaQ112880940MaRDI QIDQ776287

Hanno Lefmann, Sang June Lee

Publication date: 8 July 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2020.111964

zbMATH Keywords

independence numberindependent setanti-Ramsey problemnon-uniform hypergraphuncrowded hypergraph

Mathematics Subject Classification ID

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

Related Items (3)

Independence number of hypergraphs under degree conditions ⋮ Infinite Sidon Sets Contained in Sparse Random Sets of Integers ⋮ Coloring the normalized Laplacian for oriented hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• A note on Ramsey numbers
• Extremal uncrowded hypergraphs
• Multicolored subsets in colored hypergraphs
• Turan's theorem for \(k\)-graphs
• The Algorithmic Aspects of Uncrowded Hypergraphs
• Infinite Sidon Sets Contained in Sparse Random Sets of Integers
• On uncrowded hypergraphs
• Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• An anti-Ramsey theorem

This page was built for publication: On the independence number of non-uniform uncrowded hypergraphs