On the independence number of non-uniform uncrowded hypergraphs
type: Item
instance of: scholarly article
title: On the independence number of non-uniform uncrowded hypergraphs
zbMATH Open document ID: 1443.05148
author: Sang June Lee
author: Hanno Lefmann
published in: Discrete Mathematics
publication date: 2020-07-08T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 7218793
zbMATH Keywords: independence number
zbMATH Keywords: independent set
zbMATH Keywords: uncrowded hypergraph
zbMATH Keywords: non-uniform hypergraph
zbMATH Keywords: anti-Ramsey problem
MaRDI profile type: Publication
Wikidata QID: Q112880940
full work available at URL: j.disc.2020.111964
OpenAlex ID: W3026113632
cites work: Extremal uncrowded hypergraphs
cites work: A note on Ramsey numbers
cites work: Q3137169
cites work: An anti-Ramsey theorem
cites work: The Algorithmic Aspects of Uncrowded Hypergraphs
cites work: On uncrowded hypergraphs
cites work: Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs
cites work: Infinite Sidon Sets Contained in Sparse Random Sets of Integers
cites work: The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
cites work: Multicolored subsets in colored hypergraphs
cites work: Turan's theorem for \(k\)-graphs
cites work: Q5781249
DOI: 10.1016/J.DISC.2020.111964
description: scientific article; zbMATH DE number 7218793