On the independence number of non-uniform uncrowded hypergraphs

DOI10.1016/J.DISC.2020.111964MaRDI QIDQ776287zbMATH OpenOpenAlexWikidataFDO

Authors Sang June Lee, Hanno Lefmann

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

anti-Ramsey problemindependence numberindependent setnon-uniform hypergraphuncrowded hypergraph

Mathematics Subject Classification ID

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

Recommendations

• On uncrowded hypergraphs
• Independence in 5-uniform hypergraphs
• On independent sets in hypergraphs
• Independence numbers of hypergraphs with sparse neighborhoods.
• Independence number of hypergraphs under degree conditions

Cites work

• A note on Ramsey numbers
• An anti-Ramsey theorem
• Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs
• Extremal uncrowded hypergraphs
• scientific article; zbMATH DE number 426321 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Infinite Sidon sets contained in sparse random sets of integers
• Multicolored subsets in colored hypergraphs
• On uncrowded hypergraphs
• The Algorithmic Aspects of Uncrowded Hypergraphs
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• Turan's theorem for k-graphs

Cited in

(14)

• Large independent sets in shift-invariant graphs
• Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
• Coloring the normalized Laplacian for oriented hypergraphs
• scientific article; zbMATH DE number 16113 (Why is no real title available?)
• Independence densities of hypergraphs
• The Algorithmic Aspects of Uncrowded Hypergraphs
• Infinite Sidon sets contained in sparse random sets of integers
• On uncrowded hypergraphs
• Independent sets in hypergraphs with a forbidden link
• On independent sets in hypergraphs
• Convex Hulls of Point-Sets and Non-uniform Hypergraphs
• Independent sets in hypergraphs omitting an intersection
• Independence number of hypergraphs under degree conditions
• Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776287)